Showing papers on "Single-machine scheduling published in 1982"
01 Jan 1982
TL;DR: A survey of deterministic sequencing and scheduling can be found in this article, where the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory.
Abstract: The theory of deterministic sequencing and scheduling has expanded rapidly during the past years. 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. This paper is a revised version of the survey by Graham et al. (Ann. Discrete Math. 5(1979) 287–326) , with emphasis on recent developments.
326 citations