Journal of Scheduling

, Volume 10, Issue 1, pp 77–84 | Cite as

Single-machine scheduling with general costs under compound-type distributions

  • Xiaoqiang Cai
  • Xianyi Wu
  • Xian Zhou


We investigate the problem of scheduling n jobs on a single machine with the following features. The cost functions are general stochastic processes, which can be used to model the effects of stochastic price fluctuations, stochastic due times, etc., and the stochastic processing times follow a class of distributions, which includes exponential, geometric, and other families of distributions. Such a class of distributions is characterized by its characteristic functions. The optimal policies for these scheduling problems, both without precedence constraints, or with precedence in the form of nonpreemptive chains, are discussed, respectively.


Stochastic scheduling Single machine Stochastic cost functions Due dates Characteristic functions Increment order Convexity order 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bagga, P. C. and K. R. Kalra, “Single machine scheduling problem with quadratic functions of completion times—a modified approach,” Journal of Information & Optimization Sciences, 2, 103–108 (1981).Google Scholar
  2. Bertoin, J., Lévy Processes. Cambridge University Press, New York, 1996.Google Scholar
  3. Bisgaard, T. M. and S. Zoltan, Characteristic Functions and Moments Sequences: Positive Definiteness in Probability, Nova Science (2000).Google Scholar
  4. Boxma, O. J. and F. G. Forst, “Minimizing the expected weighted number of tardy jobs in stochastic flow shops,” Operations Research Letters, 5, 119–126 (1986).CrossRefGoogle Scholar
  5. Boys, R. J., K. D. Glazebrook, and C. M. McCrone, “Single machine scheduling when processing times are correlated normal random variables,” European Journal of Operational Research, 102, 111–123 (1997).CrossRefGoogle Scholar
  6. Brown, M. and H. Solomon, “Optimal issuing policies under stochastic field lives,” Journal of Applied Probability, 10, 761–768 (1973).CrossRefGoogle Scholar
  7. Cai, X. and X. Zhou, “Asymmetric earliness and tardiness scheduling with exponential processing times on an unreliable machine,” Annals of Operations Research, 98, 313–331 (2000).CrossRefGoogle Scholar
  8. Cai, X. and X. Zhou, “Single-machine scheduling with exponential processing time and general stochastic cost functions,” Journal of Global Optimization, 31, 317–332 (2005).CrossRefGoogle Scholar
  9. Derman, C., G. Lieberman, and S. Ross, “A renewal decision problem,” Management Science, 24, 554–561 (1978).Google Scholar
  10. Glazebrook, K. D., “Scheduling tasks with exponential service times on parallel processors,” Journal of Applied Probability, 16, 658–689 (1979).Google Scholar
  11. Jang, W. and C.M. Klein, “Minimizing the expected number of tardy jobs when processing times are normally distributed,” Operations Research Letters, 30, 100–106 (2002).CrossRefGoogle Scholar
  12. Kämpke, T., “Optimal scheduling of jobs with exponential service times on identical parallel processors,” Operations Research, 37, 126–133 (1989).Google Scholar
  13. Pinedo, M., “Stochastic scheduling with release dates and due dates,” Operations Research, 31, 559–572 (1983).CrossRefGoogle Scholar
  14. Pinedo, M., Scheduling: Theory, Algorithms, and Systems, 2nd edn., Prentice Hall, Englewood Cliffs (2002).Google Scholar
  15. Pinedo, M. and S.H. Wie, “Inequalities for stochastic flowshops and job shops,” Applied Stochastic Models and Data Analysis, 2, 61–69 (1986).Google Scholar
  16. Righter, R., “Scheduling,” in: M. Shaked and J. G. Shanthikumar (Eds.), Stochastic Orders and Their Applications. Academic, Boston, 1994, pp. 381–428.Google Scholar
  17. Rothkopf, M. H., “Scheduling with random service times,” Management Science, 12, 437–447 (1966).Google Scholar
  18. Sarin, S.C., E. Erel, and G. Steiner, “Sequencing jobs on a single machine with a common due date and stochastic processing times,” European Journal of Operational Research, 51, 287–302 (1991).CrossRefGoogle Scholar
  19. Weiss, G. and M. Pinedo, “Scheduling tasks with exponential services times on non-identical processors to minimize various cost functions,” Journal of Applied Probability, 17, 187–202 (1980).CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Xiaoqiang Cai
    • 1
  • Xianyi Wu
    • 2
  • Xian Zhou
    • 3
  1. 1.Department of Systems Engineering and Engineering ManagementThe Chinese University of Hong KongHong Kong
  2. 2.Department of StatisticsEast China Normal UniversityShanghai
  3. 3.Department of Applied MathematicsThe Hong Kong Polytechnic UniversityHong Kong

Personalised recommendations