Abstract
Things had not been going at all well in the assembly section of the Acme Bicycle Company. For the past six months, the section had consistently failed to meet its quota and heads were beginning to roll. As newly appointed foreman of the assembly section, you have been brought in to remedy this sad state of affairs. You realize that this is your big chance to catch the eye of upper management, so the first day on the job you roll up your sleeves and begin finding out everything you can about what goes on in the section.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Suggestions for Further Reading
General
Graham, Ronald L. and Garey, Michael R. The limits to computation. 1978 Yearbook of Science and the Future. Encyclopaedia Britannica, 1977, pp. 170–185.
Knuth, Donald E. Mathematics and computer science: coping with finiteness. Science 194 (December 17, 1976 ) 1235–1242.
Kolata, Gina Bari. Analysis of algorithms: coping with hard problems. Science 186 (1974) 520–521.
Steen, Lynn Arthur. Computational unsolvability. Science News, 109 (1976) 298–301.
Technical
Garey, Michael R., Graham, Ronald L., and Johnson, D.S. Performance guarantees for scheduling algorithms. Operations Research 26 (1978) 3–21.
Garey, Michael R. and Johnson, David S. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1978.
Graham, Ronald L. Bounds on the performance of scheduling algorithms. In Coffman, E. G., Computer and Jobshop Scheduling Theory. Wiley, New York, 1976.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Conference Board of the Mathematical Sciences
About this chapter
Cite this chapter
Graham, R.L. (1978). Combinatorial Scheduling Theory. In: Steen, L.A. (eds) Mathematics Today Twelve Informal Essays. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9435-8_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9435-8_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9437-2
Online ISBN: 978-1-4613-9435-8
eBook Packages: Springer Book Archive