Regular Performance Measures
Xiaoqiang Cai,
Xianyi Wu and
Xian Zhou
Additional contact information
Xiaoqiang Cai: The Chinese University of Hong Kong
Xianyi Wu: East China Normal University
Xian Zhou: Macquarie University
Chapter Chapter 2 in Optimal Stochastic Scheduling, 2014, pp 49-94 from Springer
Abstract:
Abstract This chapter covers stochastic scheduling problems with regular performance measures. Section 2.1 is focused on models of minimizing the sum of expected completion time costs. In Section 2.2, we consider the problem of minimizing the expected makespan (the maximum completion time). Some basic models with due-date related objective functions are addressed in Section 2.3. More general cost functions are considered in Section 2.4. Optimal scheduling policies when processing times follow certain classes of distributions are described in Sections 2.5 and 2.6, respectively. Basic techniques commonly employed in the field of stochastic scheduling, including the approach of adjacent job interchange, the argument of induction, and the approach of stochastic dynamic programming, are illustrated in this Chapter.
Keywords: Regular Performance Measure; General Cost Function; Shortest Expected Processing Time (SEPT); Static List Policies; Expected Cost (search for similar items in EconPapers)
Date: 2014
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:isochp:978-1-4899-7405-1_2
Ordering information: This item can be ordered from
http://www.springer.com/9781489974051
DOI: 10.1007/978-1-4899-7405-1_2
Access Statistics for this chapter
More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().