Abstract
Heuristic algorithms for intractable time-dependent scheduling problems may be constructed in many ways. In this chapter, we present two greedy time-dependent scheduling heuristic algorithms which exploit certain properties of the so-called signatures of job deterioration rates.
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
© 2020 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Gawiejnowicz, S. (2020). Greedy algorithms based on signatures. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-59362-2_15
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)