Please use this identifier to cite or link to this item: http://hdl.handle.net/10198/7277
Title: A fast heuristic for a lot splitting and scheduling problem of a textile industry
Authors: Pimentel, Carina
Alvelos, Filipe
Carvalho, J.M. Valério
Duarte, António J.S.T.
Keywords: Scheduling
Issue Date: 2010
Publisher: IFAC
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
Abstract: 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.
Peer review: no
URI: http://hdl.handle.net/10198/7277
Publisher Version: http://www.ifac-papersonline.net/Detailed/44533.html
Appears in Collections:DGI - Publicações em Proceedings Indexadas ao ISI/Scopus

Files in This Item:
File Description SizeFormat 
MCPL10_0025_FI.pdf168,25 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.