Repository logo
 
No Thumbnail Available
Publication

A fast heuristic for a lot splitting and scheduling problem of a textile industry

Use this identifier to reference this record.
Name:Description:Size:Format: 
MCPL10_0025_FI.pdf168.25 KBAdobe PDF Download

Advisor(s)

Abstract(s)

In this paper we address a lot splitting and scheduling problem of a Textile factory that produces garment pieces. Each garment piece is made of a set of components that are produced on the knitting section of the company. The problem consists of finding a weekly production plan for the knitting section, establishing the quantities to produce of each component (organized in one or several lots), and where and when starting/completion times) to produce them. The main contribution of this work is the development of a constructive heuristic that generates automated knitting scheduling plans. The heuristic produces solutions very fast for a set of randomly generated instances based on real world data.

Description

Keywords

Scheduling

Citation

Pimentel, Carina; Alvelos, Filipe; Carvalho, J.M.; Valério; Duarte, António J.S.T. (2010). A fast heuristic for a lot splitting and scheduling problem of a textile industry. In IFAC MCPL. Coimbra

Research Projects

Organizational Units

Journal Issue