Cutting and reuse: An application from automobile component manufacturing

被引:28
作者
Arbib, C
Marinelli, F
Rossi, F
Di Iorio, F
机构
[1] Univ Studi Aquila, Dipartimento Informat, I-67010 Coppito, Laquila, Italy
[2] Univ Studi Aquila, Dipartimento Matemat Pura & Applicata, I-67010 Coppito, Laquila, Italy
关键词
D O I
10.1287/opre.50.6.923.348
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents a decision support tool for solving a cutting and reuse problem arising in a European plant devoted to the production of gear belts. In this production, rectangular pieces of rubberised nylon are cut using machines employing parallel blades, so as to obtain rectangular components of identical height and (possibly) different width. A component is then used to produce a set of belts with the same girth; but, if necessary, the girth required can also be obtained by sewing together two components. The major objectives of optimisation are: trim loss minimisation, quality control, workload equalisation, setup minimisation. The problem, a particular one-dimensional cutting stock with both cutting and reuse decision variables, has been formulated in terms of integer linear programming and then efficiently solved by applying standard packages within a column generation scheme. A significant improvement of performance has been obtained in terms of both economic savings and product quality. This has convinced the management to implement the model in the plant operation.
引用
收藏
页码:923 / 934
页数:12
相关论文
共 14 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]  
[Anonymous], COMPENDIUM NP OPTIMI
[3]   Branch-and-price: Column generation for solving huge integer programs [J].
Barnhart, C ;
Johnson, EL ;
Nemhauser, GL ;
Savelsbergh, MWP ;
Vance, PH .
OPERATIONS RESEARCH, 1998, 46 (03) :316-329
[4]   Approximation algorithms to solve real-life multicriteria cutting stock problems [J].
Chu, CB ;
Antonio, J .
OPERATIONS RESEARCH, 1999, 47 (04) :495-508
[5]  
DYCKHOFF H, 1997, ANNOTATED BIBLIOGRAP, P393
[6]  
FALKENAUER E, 1999, COMMUNICATION
[7]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1961, 9 (06) :849-859
[8]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING STOCK PROBLEM .2. [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1963, 11 (06) :863-888
[9]  
HAESSLER RW, 1980, TAPPI, V63, P71
[10]   COMPUTING PARTITIONS WITH APPLICATIONS TO KNAPSACK PROBLEM [J].
HOROWITZ, E ;
SAHNI, S .
JOURNAL OF THE ACM, 1974, 21 (02) :277-292