Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities

被引:86
|
作者
Haase, K [1 ]
Kimms, A [1 ]
机构
[1] Univ Kiel, Inst Betriebswirtschaftslehre, D-24118 Kiel, Germany
关键词
lot sizing; scheduling; production planning and control; rescheduling; sequence-dependent setup times;
D O I
10.1016/S0925-5273(99)00119-X
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only efficient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and efficiently. The size of solvable cases ranges from 3 items and 15 periods to 10 items and 3 periods. Furthermore, it will become clear that rescheduling can neatly be done. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:159 / 169
页数:11
相关论文
共 50 条