A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry

Zeger Degraeve and Martina Vandebroek
Additional contact information
Zeger Degraeve: Department of Applied Economics, Katholieke Universiteit Leuven, Belgium
Martina Vandebroek: Department of Applied Economics, Katholieke Universiteit Leuven, Belgium

Management Science, 1998, vol. 44, issue 3, 301-310

Abstract: The cutting operation in the high fashion clothing industry essentially involves putting several layers of cloth on a long cutting table and fixing templates of the parts of several articles on top of the stack before the actual cutting can be initiated. This is a very time-consuming task giving raise to high setup costs in addition to waste production resulting from the cutting process. Total production costs can then be optimized by minimizing the number of these setups while at the same time producing little or no waste. In this paper a mixed integer programming model is proposed that searches for an optimal set of cutting patterns, each giving a combination of articles to be cut in one operation, and corresponding stack heights.

Keywords: Layout Problem; Cutting Stock Problem; Fashion Industry; Mixed Integer Programming (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.44.3.301 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:44:y:1998:i:3:p:301-310

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().