Multiplicity and complexity issues in contemporary production scheduling

N. Brauner, Y. Crama, A. Grigoriev, J. Van De Klundert

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


High multiplicity scheduling problems arise naturally in contemporary production settings where manufacturers combine economies of scale with high product variety. Despite their frequent occurrence in practice, the complexity of high multiplicity problems - as opposed to classical, single multiplicity problems - is in many cases not well understood. In this paper, we discuss various concepts and results that enable a better understanding of the nature and complexity of high multiplicity scheduling problems. The paper extends the framework presented in Brauner et al. [Journal of Combinatorial Optimization (2005) Vol. 9, pp. 313-323] for single machine, non-preemptive high multiplicity scheduling problems, to more general classes of problems.

Original languageEnglish
Pages (from-to)75-91
Number of pages17
JournalStatistica Neerlandica
Issue number1
StatePublished - Feb 2007
Externally publishedYes


  • Computational complexity
  • Design of algorithms
  • High multiplicity
  • Scheduling


Dive into the research topics of 'Multiplicity and complexity issues in contemporary production scheduling'. Together they form a unique fingerprint.

Cite this