Abstract
Complexity theory is based on a mathematical framework developed by logicians and computer scientists. This theory was developed to study the intrinsic difficulty of algorithmic problems and has proven very useful for combinatorial optimization. This appendix presents a brief overview of this theory and its ramifications for scheduling
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
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Pinedo, M.L. (2012). Complexity Classification of Deterministic Scheduling Problems. In: Scheduling. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-2361-4_25
Download citation
DOI: https://doi.org/10.1007/978-1-4614-2361-4_25
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-1986-0
Online ISBN: 978-1-4614-2361-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)