Abstract
In this paper a survey is presented of some of the recent results in stochastic open shop, flow shop and job shop scheduling. The distributions of the processing times of the jobs are known in advance, but the actual processing times are not known in advance. The jobs may have due dates. Optimal preemptive and nonpreemptive policies are determined for the minimization of various objective functions, such as the expected makespan, the expected flow time and the expected number of late jobs. The effect of various degrees of dependence between the processing times of any given job on the various machines is investigated. Under given conditions bounds are obtained for the expected makespan in the different models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.C. Bagga,N-job, 2 machine sequencing problem with stochastic service times. Opsearch 7 (1970) 184.
S.L. Brumelle and J.B. Sidney, The two machine makespan problem with stochastic flow times (University of British Columbia Technical Report, 1982).
A.A. Cunningham and S.K. Dutta, Scheduling jobs with exponentially distributed processing times on two machines of a flow shop, Nav. Res. Logist. Q. 16(1973)69.
H. Emmons, The two-machine job-shop with exponential processing times, in: Symposium Theory of scheduling and its Applications, ed. S.E. Elmaghraby (Springer Verlag, Berlin, 1973) p. 278.
H. Frenk and A.H.G. Rinnooy Kan, private communication. 1982.
F.G. Frost, Minimizing total expected costs in the two machine stochastic flow shop. Oper. Res. Lett. (1983) p. 58.
S.M. Johnson, Optimal two and three stage production schedules with setup times included. Nav. Res. Logist. Q. 1(1954)61.
T. Kurisu, Two machine sequencing problem with exponential processing times, Technology Reports of the Osaka University, vol. 23(1973) no. 1090.
E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Recent developments in deterministic sequencing and scheduling: a survey, in: Deterministic and Stochastic Scheduling, ed. Dempster et al. (Reidel, Dordrecht, The Netherlands, 1982) p. 35.
A.W. Marshall and F. Proschan, Classes of distrubutions applicable in replacement, with renewal theory implications, in: Proc. 6th Berkeley Symp. on Mathematical Statistics and Probability, vol. 1 (University of California, 1972) p. 395.
P.R. Milch and M.H. Waggoner, A random walk approach to shutdown queucing systems, SIAM J. Appl. Math. 19(1970)103.
S.C. Niu, Bounds and comparisons for some queueing systems (Operations Research Center Report 77-32, University of California, Berkeley, 1977).
M.L. Pinedo, A note on the two machine job shop with exponential processing times. Nav. Res. Logist. Q. 28(1981)693.
M.L. Pinedo, Minimizing the expected makespan in stochastic flow shops, Oper. Res. 30 (1982)148.
M.L. Pinedo, On the optimal order of stations in tandem queues, in: Applied Probability, Computer Science: The Interface, ed. R. Disney and T. Ott (Birkhauser, Boston, 1982) p. 307.
M.L. Pinedo, On flow time and due dates in stochastic open shops. Eur. J. of Oper. Res. (1984) to appear.
M.L. Pinedo, A note on stochastic shop models in which jobs have the same processing requirements on each machine, Mgmt. Sci. (1984) to appear.
M.L. Pinedo, Inequalities and bounds for stochastic shop models, SIAM J. of Appl. Math. (1984) to appear.
M.L. Pinedo, A note on the effect of processing times variability on the sequencing of jobs, (1984) submitted for publication.
M.L. Pinedo and S.M. Ross, Minimizing the expected makespan in stochastic open shop, Adv. Appl. Prob. (1982)898.
M.L. Pinedo and L. Schrage, Stochastic shop scheduling: a survey, in: Deterministic and Stochastic Scheduling, ed. M.A.H. Dempster et al. (Reidel, Dordrecht, The Netherlands, 1982) p. 181.
M.L. Pinedo and R. Wolff, A comparison between tandem queues with dependent and independent service times, Oper. Res. 30(1982)464.
P.P. Talwar, A note on a sequencing problem with uncertain job times. J. of the Oper. Res. Soc. of Japan 9(1967)93.
R.R. Weber, The interchangeability of tandem/M/1 queues in series, J. App. Prob. 16 (1979)690.
G. Weiss, Multiserver stochastic scheduling, in: Deterministic and Stochastic Scheduling, ed. Dempster et al. (Reidel, Dordrecht, The Netherlands, 1982) p. 157.
Author information
Authors and Affiliations
Additional information
Partially supported by the National Science Foundation (NSF), under grant ECS-8115344 with the Georgia Institute of Technology.
Rights and permissions
About this article
Cite this article
Pinedo, M. Optimal policies in stochastic shop scheduling. Ann Oper Res 1, 305–329 (1984). https://doi.org/10.1007/BF01874395
Issue Date:
DOI: https://doi.org/10.1007/BF01874395