Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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).
Bertoin, J., Lévy Processes. Cambridge University Press, New York, 1996.
Bisgaard, T. M. and S. Zoltan, Characteristic Functions and Moments Sequences: Positive Definiteness in Probability, Nova Science (2000).
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).
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).
Brown, M. and H. Solomon, “Optimal issuing policies under stochastic field lives,” Journal of Applied Probability, 10, 761–768 (1973).
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).
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).
Derman, C., G. Lieberman, and S. Ross, “A renewal decision problem,” Management Science, 24, 554–561 (1978).
Glazebrook, K. D., “Scheduling tasks with exponential service times on parallel processors,” Journal of Applied Probability, 16, 658–689 (1979).
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).
Kämpke, T., “Optimal scheduling of jobs with exponential service times on identical parallel processors,” Operations Research, 37, 126–133 (1989).
Pinedo, M., “Stochastic scheduling with release dates and due dates,” Operations Research, 31, 559–572 (1983).
Pinedo, M., Scheduling: Theory, Algorithms, and Systems, 2nd edn., Prentice Hall, Englewood Cliffs (2002).
Pinedo, M. and S.H. Wie, “Inequalities for stochastic flowshops and job shops,” Applied Stochastic Models and Data Analysis, 2, 61–69 (1986).
Righter, R., “Scheduling,” in: M. Shaked and J. G. Shanthikumar (Eds.), Stochastic Orders and Their Applications. Academic, Boston, 1994, pp. 381–428.
Rothkopf, M. H., “Scheduling with random service times,” Management Science, 12, 437–447 (1966).
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).
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).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cai, X., Wu, X. & Zhou, X. Single-machine scheduling with general costs under compound-type distributions. J Sched 10, 77–84 (2007). https://doi.org/10.1007/s10951-006-0327-3
Issue Date:
DOI: https://doi.org/10.1007/s10951-006-0327-3