Parallel Machine Models (Stochastic)

Michael L. Pinedo ()
Additional contact information
Michael L. Pinedo: New York University

Chapter Chapter 12 in Scheduling, 2012, pp 321-348 from Springer

Abstract: Abstract This chapter deals with parallel machine models that are stochastic counterparts of models discussed in The body of knowledge in the stochastic case is somewhat less extensive than in the deterministic case

Keywords: Processing Time; Completion Time; Total Completion Time; Online Schedule; Dynamic Policy (search for similar items in EconPapers)
Date: 2012
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-1-4614-2361-4_12

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

DOI: 10.1007/978-1-4614-2361-4_12

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 ().