Multiplicity and complexity issues in contemporary production scheduling

N. Brauner*, Y. Crama, A. Grigoriev, J. van de Klundert

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

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 brauneret 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 pages16
JournalStatistica Neerlandica
Volume61
Issue number1
DOIs
Publication statusPublished - 1 Jan 2007

Cite this