Please use this identifier to cite or link to this item:
Title: A scheduling model for a knitting planning problem
Author: Pimentel, Carina
Alvelos, Filipe
Duarte, António J.S.T.
Carvalho, J.M. Valério
Keywords: Planning and scheduling
Mixed integer programming
Network flows
Issue Date: 2008
Citation: Pimentel, Carina; Alvelos, Filipe; Duarte, António J.S.T.; Carvalho, J.M. Valério (2008) - A scheduling model for a knitting planning problem. In POM Tokio 2008 - 3rd World Conference on Production and Operations Management. Tokio. ISBN 978-4-88361-646-6
Abstract: In this paper we present two planning and scheduling models for a real problem of a textile industry that produces fine knitted goods. In both of them we develop plans to assist the knitting planning of one of three knitting subsections. In this problem we intend to assign and sequence, within a set of available and identical parallel machines, the demand associated with each component or garment part. This demand can be split in lots of smaller quantities and these lots can be independently produced at any time in one or more of the available machines. In the first model we develop a mixed integer programming (MIP) formulation and in the second one we develop network flow based models and a scheduling heuristic. The main advantage of the second model, in opposition to the first one, is the small computational resources needed to solve this huge and complex problem. We solve an instance generated in accordance with the characteristics of the real problem by the second model and present some performance measures.
Peer review: yes
ISBN: 978-4-88361-646-6
Appears in Collections:DGI - Artigos em Proceedings Não Indexados ao ISI/Scopus

Files in This Item:
File Description SizeFormat 
POM - A scheduling model for a knitting planning problem.pdf1,5 MBAdobe PDFView/Open

FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

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