Regular Performance Measures
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.
- Bertoin, J. (1996).Lévy Processes. New York: Cambridge University Press.Google Scholar
- Bisgaard, T. M., & Zoltan, S. (2000). Characteristic functions and moments sequences: Positive definiteness in probability. Huntington: Nova Science.Google Scholar
- Cai, X.Q.i, & Zhou, X. (2005). Single-machine scheduling with exponential processing times and general stochastic cost functions. Journal of Global Optimization, 31, 317–332.Google Scholar
- Cai, X.Q., Wu, X.Y., & Zhou, X. (2009b). Stochastic scheduling subject to breakdown-repeat breakdowns with incomplete information. Operations Research, 57(5), 1236–1249. With an electronic companion.Google Scholar
- Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Science Research Project, UCLA.Google Scholar
- Pinedo, M. (2002). Scheduling: Theory, algorithms, and systems (2nd ed.). Englewood Cliffs: Prentice Hall.Google Scholar