Sequencing and scheduling : algorithms and complexity

E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

910 Citations (Scopus)

Abstract

Sequencing and scheduling as a research area is motivated by questions that arise in production planning, in computer control, and generally in all situations in which scarce resources have to be allocated to activities over time. In this survey, we concentrate on the area of deterministic machine scheduling. We review complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops. We also pay attention to two extensions of this area: resource-constrained project scheduling and stochastic machine scheduling.
Original languageEnglish
Title of host publicationLogistics of Production and Inventory
EditorsS.S. Graves, A.H.G. Rinnooy Kan, P. Zipkin
Place of PublicationAmsterdam
PublisherNorth-Holland Publishing Company
Pages445-522
ISBN (Print)0-444-87472-0
Publication statusPublished - 1993

Publication series

NameHandbooks in Operations Research and Management Science
Volume4
ISSN (Print)0927-0507

Fingerprint Dive into the research topics of 'Sequencing and scheduling : algorithms and complexity'. Together they form a unique fingerprint.

Cite this