Abstract
This is the second chapter of the fourth part of the book, devoted to intractable time-dependent scheduling problems. In this chapter, we discuss NP-hard parallel machine time-dependent scheduling problems.
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
© 2020 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Gawiejnowicz, S. (2020). \( \mathcal{NP} \)-hard parallel machine problems. In: Models and Algorithms of Time-Dependent Scheduling. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-59362-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-59362-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-59361-5
Online ISBN: 978-3-662-59362-2
eBook Packages: Computer ScienceComputer Science (R0)