Abstract
Stochastic models, especially with exponential processing times, may often contain more structure than their deterministic counterparts and may lead to results which, at first sight, seem surprising. Models that are NP hard in a deterministic setting often allow a simple priority policy to be optimal in a stochastic setting
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
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Pinedo, M.L. (2012). Single Machine Models (Stochastic). In: Scheduling. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-2361-4_10
Download citation
DOI: https://doi.org/10.1007/978-1-4614-2361-4_10
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)