Basic Scheduling Problems with Raw Material Constraints

A. Grigoriev*, M. Holthuijsen, Joris van de Klundert

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


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 lmax and cmax 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
Publication statusPublished - 1 Jan 2005

Cite this