Abstract
This chapter establishes the NP-hardiness of a number of scheduling problems. To prove that a given Problem B is NP-hard, we use the following scheme. The decision Problem B’ corresponding to Problem B is formulated, and a Problem A is shown to be polynomially reducible to B’ where A is one of the standard problems, i.e., a decision problem known to be NP-complete. If Problem A is NP-complete in the strong sense, then sometimes it is shown to be pseudopolynomially reducible to Problem B’.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Tanaev, V.S., Gordon, V.S., Shafransky, Y.M. (1994). NP-Hard Problems. In: Scheduling Theory. Single-Stage Systems. Mathematics and Its Applications, vol 284. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1190-4_5
Download citation
DOI: https://doi.org/10.1007/978-94-011-1190-4_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4520-9
Online ISBN: 978-94-011-1190-4
eBook Packages: Springer Book Archive