Integration of assembly and fabrication for make-to-order production

被引:41
作者
Kolisch, R [1 ]
机构
[1] Tech Univ Darmstadt, Fachgebiet Baubetriebswirtshaftslehre, Inst Betriebswirtschaftslehre, D-64289 Darmstadt, Germany
关键词
assembly; lot-sizing; make-to-order; supply chain management;
D O I
10.1016/S0925-5273(99)00011-0
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The problem of make-to-order production is as follows. A number of customer-specific orders have to be assembled in a multi-project type environment. Each order is made of different assembly jobs which are interrelated by precedence constraints. To be processed, an assembly job requires in-house fabricated and out-house procured parts as well as capacity of assembly resources (assembly workers, power tools). Different customer orders need the same part types and hence the fabrication of parts has to take into account lot sizing decisions. The overall problem is how to coordinate fabrication and assembly with respect to scarce capacities in the assembly and the fabrication such that the holding- and setup-cost of the entire supply chain - fabrication-assembly - are minimized. This problem has not been treated in the literature so far. Hence, we give a mixed-integer programming model for the problem and discuss its properties. Afterwards, we propose a simple, two-level backward oriented heuristic and evaluate it on a set of benchmark instances. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:287 / 306
页数:20
相关论文
共 68 条
[1]  
[Anonymous], ADV PROJECT SCHEDULI
[2]  
Aquilano N. J., 1980, Journal of Operations Management, V1, P57
[3]   STRONG FORMULATIONS FOR MULTI-ITEM CAPACITATED LOT SIZING [J].
BARANY, I ;
VANROY, TJ ;
WOLSEY, LA .
MANAGEMENT SCIENCE, 1984, 30 (10) :1255-1261
[4]   MATHEMATICAL-PROGRAMMING APPROACHES TO CAPACITY-CONSTRAINED MRP SYSTEMS - REVIEW, FORMULATION AND PROBLEM REDUCTION [J].
BILLINGTON, PJ ;
MCCLAIN, JO ;
THOMAS, LJ .
MANAGEMENT SCIENCE, 1983, 29 (10) :1126-1141
[5]   HEURISTICS FOR MULTILEVEL LOT-SIZING WITH A BOTTLENECK [J].
BILLINGTON, PJ ;
MCCLAIN, JO ;
THOMAS, LJ .
MANAGEMENT SCIENCE, 1986, 32 (08) :989-1006
[6]  
BIXBY N, 1996, USING CPLEX CALLABLE
[7]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[8]   SET PARTITIONING AND COLUMN GENERATION HEURISTICS FOR CAPACITATED DYNAMIC LOTSIZING [J].
CATTRYSSE, D ;
MAES, J ;
VANWASSENHOVE, LN .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 46 (01) :38-47
[9]  
Chao J.S., 1998, Production and Operations Management, V7, P38
[10]  
Chen W.-H., 1990, Annals of Operations Research, V26, P29, DOI 10.1007/BF02248584