Single Machine Models (Stochastic)

Michael L. Pinedo
Additional contact information
Michael L. Pinedo: NYU Stern School of Business, IOMS Dept Rm 8-59 KMC

Chapter Chapter 10 in Scheduling, 2016, pp 265-291 from Springer

Abstract: 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.

Keywords: Processing Time; Single Machine; Single Machine Schedule; Stochastic Version; Deterministic Problem (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-26580-3_10

Ordering information: This item can be ordered from
http://www.springer.com/9783319265803

DOI: 10.1007/978-3-319-26580-3_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().