Optimization and approximation in deterministic sequencing and scheduling : a survey

R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan

    Research output: Contribution to journalArticleAcademicpeer-review

    3851 Citations (Scopus)
    21 Downloads (Pure)

    Abstract

    The theory of deterministic sequencing and scheduling has expanded rapidly during the past years. In this paper we survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory. Special cases considered are single machine scheduling, identical, uniform and unrelated parallel machine scheduling, and open shop, flow shop and job shop scheduling. We indicate some problems for future research and include a selective bibliography.
    Original languageEnglish
    Pages (from-to)287-326
    JournalAnnals of Discrete Mathematics
    Volume5
    DOIs
    Publication statusPublished - 1979

    Fingerprint Dive into the research topics of 'Optimization and approximation in deterministic sequencing and scheduling : a survey'. Together they form a unique fingerprint.

    Cite this