Skip to main content
SpringerLink
Log in

Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

In this paper, we consider a special variant of a capacitated dynamic lot sizing problem which, despite its practical relevance, has not been treated sufficiently in the literature. In addition to the significant complexity introduced by the sequence dependency of setup times, the problem is further complicated by the fact that there is only one single setup operator which is responsible for all setups on all machines. Hence, the multi-machine problem cannot be decomposed into multiple single machine problems, as the setup operations must be coordinated among the different machines. In addition, lots are produced in batches whereby the processing time of a lot is a step-wise function of the number of batches per lot. Due to perishability and quarantine issues, time windows for the production are given. We formulate a big-bucket lot sizing model and apply MIP-based heuristics to two industrial data sets.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Almeder C, Almada-Lobo B (2011) Synchronisation of scarce resources for a parallel machine lotsizing problem. Int J Prod Res 49(24):7315–7335

    Article  Google Scholar 

  • Amorim P, Antunes CH, Almada-Lobo B (2011) Multi-objective lot-sizing and scheduling dealing with perishability issues. Ind Eng Chem Res 50(6):3371–3381

    Article  Google Scholar 

  • Brahimi N, Dauzère-Peres S, Najid NM (2006) Capacitated multi-item lot-sizing problems with time windows. Oper Res 54(5):951–967

    Article  Google Scholar 

  • Buschkühl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectr 32(2):231–261

    Article  Google Scholar 

  • Clark A, Mahdieh M, Rangel S (2014) Production lot sizing and scheduling with non-triangular sequence-dependent setup times. Int J Prod Res 52(8):2490–2503

    Article  Google Scholar 

  • Clark AR, Clark SJ (2000) Rolling-horizon lot-sizing when set-up times are sequence-dependent. Int J Prod Res 38(10):2287–2307

    Article  Google Scholar 

  • Dillenberger C, Escudero LF, Wollensak A, Zhang W (1994) On practical resource allocation for production planning and scheduling with period overlapping setups. Eur J Oper Res 75(2):275–286

    Article  Google Scholar 

  • Drexl A, Haase K (1995) Proportional lotsizing and scheduling. Int J Prod Econ 40(1):73–87

    Article  Google Scholar 

  • Fleischmann B, Henneberg T (1993) A decision support system for determining the flexibility and service level of a JIT production. In: Advanced in production management systems, pp 349–356

  • Helber S, Sahling F (2010) A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int J Prod Econ 123(2):247–256

    Article  Google Scholar 

  • James RJ, Almada-Lobo B (2011) Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics. Comput Oper Res 38(12):1816–1825

    Article  Google Scholar 

  • Jans R, Degraeve Z (2007) Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. Eur J Oper Res 177(3):1855–1875

    Article  Google Scholar 

  • Mateus GR, Ravetti MG, de Souza MC, Valeriano TM (2010) Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration. J Sched 13(3):245–259

    Article  Google Scholar 

  • Meyr H (1999) Simultane Losgrößen- und Reihenfolgeplanung für kontinuierliche Produktionslinien. Gabler Edition Wissenschaft: Produktion und Logistik. Gabler, Wiesbaden

    Book  Google Scholar 

  • Meyr H (2002) Simultaneous lotsizing and scheduling on parallel machines. Eur J Oper Res 139(2):277–292

    Article  Google Scholar 

  • Pahl J, Voß S (2014) Integrating deterioration and lifetime constraints in production and supply chain planning: a survey. Eur J Oper Res 238(3):654–674

    Article  Google Scholar 

  • Quadt D, Kuhn H (2008) Capacitated lot-sizing with extensions: a review. 4OR 6(1):61–83

    Article  Google Scholar 

  • Stadtler H (2003) Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows. Oper Res 51(3):487–502

    Article  Google Scholar 

  • Tempelmeier H, Buschkühl L (2008) Dynamic multi-machine lotsizing and sequencing with simultaneous scheduling of a common setup resource. Int J Prod Econ 113(1):401–412

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Supply Chain Management and Production, University of Cologne, Cologne, Germany

    Horst Tempelmeier & Karina Copil

Authors
  1. Horst Tempelmeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karina Copil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Horst Tempelmeier.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tempelmeier, H., Copil, K. Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator. OR Spectrum 38, 819–847 (2016). https://doi.org/10.1007/s00291-015-0410-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-015-0410-2

Keywords

Search

Navigation