 Multi-level single machine lot-sizing and scheduling with zero lead timesHartmut Stadtler European Journal of Operational Research, 2011, vol. 209, issue 3, 241-252 Abstract: A pharmaceutical company raised the question whether an increased product portfolio could still be manufactured on the existing machinery. The proportional lot-sizing and scheduling problem (PLSP) seemed to be most appropriate to answer this question. However, although there are papers dealing with a multi-level PLSP none allows a zero lead time offset which is a prerequisite for the case considered here. In this paper we will extend and modify an existing mixed integer linear programming (MIP) model formulation in two ways: first, we will extend the single-level single machine PLSP to a multi-level single machine PLSP (PLSP-ML-SM) with a zero lead time offset. Second, we will describe a new and more compact model formulation incorporating period overlapping setup times and batch size constraints. Based on the real-world application several test instances have been generated to provide insights into those characteristics which make instances of the PLSP-ML-SM difficult to solve by a standard MIP solver. Keywords: Lot-sizing; Scheduling; PLSP; Bill; of; materials; Lead; time (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:209:y:2011:i:3:p:241-252 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.