Summary: This paper deals with lot sizing and scheduling for a single-stage production system where setup costs and times are sequence dependent. A large bucket mixed integer programming (MIP) model is formulated which considers only e cient sequences. A tailor-made enumeration method of the branch-andbound type solves problem instances optimally and e ciently. Furthermore, it will become clear that rescheduling can neatly be done.
REF study a single-stage, single-machine production system where setup costs and times are sequence dependent.
Lot Sizing and Scheduling with Sequence Dependent Setup Costs and Times and Efficient Rescheduling Opportunities
Economics Engineering Computer Science