Optimal Stochastic Scheduling pp 49-94 | Cite as

# Regular Performance Measures

## 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.

## References

- Bagga, P. C., & Kalra, K. R. (1981). Single machine scheduling problem with quadratic functions of completion times – A modified approach.
*Journal of Information & Optimization Sciences, 2*, 103–108.CrossRefGoogle Scholar - Banerjee, B. P. (1965). Single facility sequencing with random execution times.
*Operations Research, 13*, 358–364.CrossRefGoogle Scholar - 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 - Boxma, O. J., & Forst, F. G. (1986). Minimizing the expected weighted number of tardy jobs in stochastic flow shops.
*Operations Research Letters, 5*, 119–126.CrossRefGoogle Scholar - Boys, R. J., Glazebrook, K. D., & McCrone, C. M. (1997). Single machine scheduling when processing times are correlated normal random variables.
*European Journal of Operations Research, 102*, 111–123.CrossRefGoogle 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 - Crabill, T. B., & Maxwell, W. L. (1969). Single machine sequencing with random processing times and random due dates.
*Naval Research Logistic Quarterly, 19*, 549–554.CrossRefGoogle Scholar - Derman, C., Lieberman, G., & Ross, S. (1978). A renewal decision problem.
*Management Science, 24*, 554–561.CrossRefGoogle Scholar - Emmons, H., & Pinedo, M. (1990). Scheduling stochastic jobs with due dates on parallel machines.
*European Journal of Operational Research, 47*, 49–55.CrossRefGoogle Scholar - Erel, E., & Sarin, S. C. (1989). Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines.
*Annals of Operations Research, 17*, 181–198.CrossRefGoogle Scholar - Glazebrook, K. D. (1979). Scheduling tasks with exponential service times on parallel processors.
*Journal of Applied Probability, 16*, 685–689.CrossRefGoogle Scholar - Jackson, J. R. (1955).
*Scheduling a production line to minimize maximum tardiness*(Research Report 43). Management Science Research Project, UCLA.Google Scholar - Jang, W., & Klein, C. M. (2002). Minimizing the expected number of tardy jobs when processing times are normally distributed.
*Operation Research Letters, 30*, 100–106.CrossRefGoogle Scholar - Kämpke, T. (1989). Optimal scheduling of jobs with exponential service times on identical parallel processors.
*Operations Research, 37*, 126–133.CrossRefGoogle Scholar - Karp, R. M. (1972). Reducibility among combinational problems. In R. E. Miller & J. W. Thatcher (Eds.),
*Complexity of Computer Computations*(pp. 85–103). New York: Plenum Press.CrossRefGoogle Scholar - Pinedo, M. (1983). Stochastic scheduling with release dates and due dates.
*Operations Research, 31*, 559–572.CrossRefGoogle Scholar - Pinedo, M. (2002).
*Scheduling: Theory, algorithms, and systems*(2nd ed.). Englewood Cliffs: Prentice Hall.Google Scholar - Pinedo, M., & Wei, S. H. (1986). Inequalities for stochastic flowshops and job shops.
*Applied Stochastic Models and Data Analysis, 2*, 61–69.CrossRefGoogle Scholar - Pinedo, M., & Weiss, G. (1987). The largest variance first policy in some stochastic scheduling problems.
*Operations Research, 35*, 884–891.CrossRefGoogle Scholar - Rothkopf, M. H. (1966a). Scheduling with random service times.
*Management Science, 12*, 707–713.CrossRefGoogle Scholar - Sarin, S. C., Erel, E., & Steiner, G. (1991). Sequencing jobs on a single machine with a common due date and stochastic processing times.
*European Journal of Operational Research, 51*, 287–302.CrossRefGoogle Scholar - Smith, W. E. (1956). Various optimizers for single-stage production.
*Naval Research Logistics Quarterly, 3*, 59–66.CrossRefGoogle Scholar - Townsend, W. (1978). The single-machine problem with quadratic penalty function of completion times: A branch-and-bound solution.
*Managment Science, 24*, 530–534.CrossRefGoogle Scholar - Weber, R. R. (1982a). Scheduling stochastic jobs on parallel machines to minimize makespan or flowtime. In R. Disney & T. Ott (Eds.),
*Applied probability – Computer science: The interface*(pp. 327–337). Boston: Birkhauser.CrossRefGoogle Scholar - Weber, R. R., Varaiya, P., & Walrand, J. (1986). Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime.
*Journal of Applied Probability, 23*, 841–847.CrossRefGoogle Scholar - Weiss, G., & Pinedo, M. (1980). Scheduling tasks with exponential service times on nonidentical processors to minimize various cost functions.
*Journal of Applied Probability, 17*, 187–202.CrossRefGoogle Scholar - Zhou, X., & Cai, X. Q. (1997). General stochastic single-machine scheduling with regular cost functions.
*Mathematical and Computer Modeling, 26*, 95–108.CrossRefGoogle Scholar