Basic scheduling problems with raw material constraints

Alexander Grigoriev, Martijn Holthuijsen, Joris Van De Klundert

Research output: Contribution to journalArticlepeer-review

31 Scopus citations


One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and Lmux and Cmux objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments.

Original languageEnglish
Pages (from-to)527-535
Number of pages9
JournalNaval Research Logistics
Issue number6
StatePublished - Sep 2005
Externally publishedYes


  • Approximation algorithms
  • Computational complexity
  • Raw material requirements
  • Scheduling


Dive into the research topics of 'Basic scheduling problems with raw material constraints'. Together they form a unique fingerprint.

Cite this