A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Bo Chen (), Chris N. Potts () and Gerhard J. Woeginger ()
Additional contact information
Bo Chen: University of Warwick, Warwick Business School
Chris N. Potts: University of Southampton, Faculty of Mathematical Studies
Gerhard J. Woeginger: Graz University of Technology, Institut für Mathematik

A chapter in Handbook of Combinatorial Optimization, 1998, pp 1493-1641 from Springer

Abstract: Abstract The scheduling of computer and manufacturing systems has been the subject of extensive research for over forty years. In addition to computers and manufacturing, scheduling theory can be applied to many areas including agriculture, hospitals and transport. The main focus is on the efficient allocation of one or more resources to activities over time. Adopting manufacturing terminology, a job consists of one or more activities, and a machine is a resource that can perform at most one activity at a time. We concentrate on deterministic machine scheduling for which it is assumed that all data that define a problem instance are known with certainty.

Keywords: Schedule Problem; Competitive Ratio; Flow Shop; Precedence Constraint; Open Shop (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (2)

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-1-4613-0303-9_25

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

DOI: 10.1007/978-1-4613-0303-9_25

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 ().