Abstract
In the previous chapter, we recalled the basic notions and definitions of the classical scheduling theory, where one assumes that fixed job processing times are numbers. Though the scope of applicability of the classical scheduling theory is impressive, the above assumption does not allow us to consider problems in which jobs have variable processing times.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). The modern scheduling theory. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-59362-2_5
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)