Recent Results in the Theory of Machine Scheduling

E. L. Lawler
Additional contact information
E. L. Lawler: University of California, College of Engineering, Computer Science Division

A chapter in Mathematical Programming The State of the Art, 1983, pp 202-234 from Springer

Abstract: Abstract The state of the art of deterministic machine scheduling is reviewed. Emphasis is placed on efficient, i. e. polynomial-bounded, optimization algorithms. A few of the more significant NP-hardness results are highlighted, and some open problems are mentioned.

Keywords: Parallel Machine; Flow Shop; Precedence Constraint; Feasible Schedule; Open Shop (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-68874-4_9

Ordering information: This item can be ordered from
http://www.springer.com/9783642688744

DOI: 10.1007/978-3-642-68874-4_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().