ON PRACTICAL RESOURCE-ALLOCATION FOR PRODUCTION PLANNING AND SCHEDULING WITH PERIOD OVERLAPPING SETUPS

被引:104
作者
DILLENBERGER, C [1 ]
ESCUDERO, LF [1 ]
WOLLENSAK, A [1 ]
WU, Z [1 ]
机构
[1] IBM CORP,THOMAS J WATSON RES CTR,DEPT 432G MFG MODELLING & LOGIST,YORKTOWN HTS,NY 10598
关键词
PRODUCTION PLANNING; LOTSIZING; MIXED INTEGER PROGRAMMING; ENUMERATION; HEURISTICS;
D O I
10.1016/0377-2217(94)90074-4
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Capacity requirements planning is normally based on long-term demand forecasts and part type mix estimates. In the execution of a production plan, it must often be recognized that the capacity assumptions previously made are no longer valid. This is because the part type mix, the operator or machine availability, or the existence of additional resources has changed. This may lead to underload as well as to overload situations for particular time periods. This paper presents a mixed 0-1 model and outlines a practical algorithm to schedule the production quantities. Our approach takes into account all information available on the shop-floor level, such as: machine availability over the planning horizon, unit processing times for the part types, minor setup times (i.e., machine setups required when changing part types that belong to the same family), major setup times (i.e., machine setups required when changing part types that belong to different families), storable and non-storable resource availability and consumption, part type demand over the planning horizon, and bounds on production rate and backlogging. Furthermore, the model accounts correctly for costs corresponding to period overlapping setups. Also, the application of the model in some case studies is reported.
引用
收藏
页码:275 / 286
页数:12
相关论文
共 8 条
[1]  
DEMATTA R, 1988, ORSA TIMS M DENV
[2]  
DEMATTA R, 1989, 891204 U PENNS WHART
[3]  
DILLENBERGER C, 1990, MATH FORMULATION RES
[4]   A STRONG CUTTING PLANE ALGORITHM FOR PRODUCTION SCHEDULING WITH CHANGEOVER COSTS [J].
MAGNANTI, TL ;
VACHANI, R .
OPERATIONS RESEARCH, 1990, 38 (03) :456-473
[5]   SOLVING MULTIITEM LOT-SIZING PROBLEMS USING STRONG CUTTING PLANES [J].
POCHET, Y ;
WOLSEY, LA .
MANAGEMENT SCIENCE, 1991, 37 (01) :53-67
[6]   CAPACITATED LOT SIZING WITH SETUP TIMES [J].
TRIGEIRO, WW ;
THOMAS, LJ ;
MCCLAIN, JO .
MANAGEMENT SCIENCE, 1989, 35 (03) :353-366
[7]   UNCAPACITATED LOT-SIZING PROBLEMS WITH START-UP COSTS [J].
WOLSEY, LA .
OPERATIONS RESEARCH, 1989, 37 (05) :741-747
[8]  
1991, IBM SC230519 FORM