Abstract
This paper is concerned with stochastic scheduling problems with several identical parallel machines, where the task durations and precedence constraints are stochastic. The stochastic precedence constraints are given by special GERT networks. At first, basic concepts and results are surveyed for GERT networks and for single-machine and parallel-machine scheduling with GERT network precedence constraints. An example shows where GERT scheduling problems occur in practice. After that, two types of heuristics for identical parallel-machine GERT scheduling problems with objective functions E(C max ), maxE(C),and E(∑ C) are proposed: generalizations of algorithms for corresponding deterministic scheduling problems and so-called priority-rule methods. An empirical analysis shows the best heuristics for each of the objective functions considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows, Prentice-Hall, Englewood Cliffs, 1993.
P. Billingsley, Probability and Measure, Wiley, New York, 1986.
M. Bücker, Ein-Maschinen-Probleme mit stochastischen Reihenfolgebeziehungen unter besonderer Berücksichtigung polynomialer Algorithmen, Ph.D. Thesis, Universität Fridericiana zu Karlsruhe, 1990.
M. Bücker, Time complexity of single machine scheduling with stochastic precedence constraints, ZOR – Mathematical Methods of Operations Research 36(1992)211–225.
M. Bücker, K. Neumann and T. Rubach, Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flowtime or maximum expected lateness, ZOR – Mathematical Methods of Operations Research 39(1994)321–348.
E.G. Coffman and R.L. Graham, Optimal scheduling for two processor systems, Acta Informatica 1(1972)200–213.
W.J. Conover, Practical Nonparametric Statistics, Wiley, New York, 1971.
M.A.H. Dempster, J.K. Lenstra and A.H.G Rinnooy Kan (eds.), Deterministic and Stochastic Scheduling, D. Reidel, Dordrecht, 1982.
S.E. Elmaghraby, Activity Networks, Wiley, New York, 1977.
L.R. Foulds, D. Hoffmann and K. Neumann, Stochastic identical parallel machine scheduling with OR precedence constraints, Asia–Pacific J. of Operational Research 8(1991)1–25.
E. Frostig, A stochastic scheduling problem with intree precedence constraints, Operations Research 36(1988)937–943.
M. Fujii, T. Kasami and K. Ninomiya, Optimal sequencing of two equivalent processors, SIAM J. Applied Mathematics 17(1969)784–789, Erratum 20(1971)141.
B.L. Golden and A.A. Assad, A decision-theoretic framework for comparing heuristics, European J. of Operational Research 18(1984)167–171.
B.L. Golden and W.R. Stewart, Empirical analysis of heuristics, in: The Traveling Salesman Problem, eds. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Wiley, New York, 1987.
W.A. Horn, Single-machine job sequencing with treelike precedence ordering and linear delay penalties, SIAM J. of Applied Mathematics 23(1972)189–202.
T.C. Hu, Parallel sequencing and assembly line problems, Operations Research 9(1961)841–848.
E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints, Management Science 19(1973)544–546.
R.H. Möhring and F.J. Radermacher, An introduction to stochastic scheduling problems, in: Contributions to Operations Research, eds. K. Neumann and D. Pallaschke, Lecture Notes in Economics and Mathematical Systems, Vol. 240, Springer, Berlin, 1985.
K. Neumann, Stochastic Project Networks, Lecture Notes in Economics and Mathematical Systems, Vol. 344, Springer, Berlin, 1990.
K. Neumann and U. Steinhardt, GERT Networks and the Time-Oriented Evaluation of Projects, Lecture Notes in Economics and Mathematical Systems, Vol. 172, Springer, Berlin, 1979.
P.M. Pardalos and G.P. Rodgers, A branch and bound algorithm for the maximum clique problem, Computers and Operations Research 19(1992)375–382.
M. Pinedo, Scheduling, Prentice-Hall, Englewood Cliffs, 1995.
M. Pinedo and G. Weiss, Scheduling jobs with exponentially distributed processing times and intree precedence constraints on two parallel machines, Operations Research 33(1984)1381–1388.
R. Righter, Stochastic scheduling, in: Stochastic Orders, eds. M. Shaked and G. Shanthikumar, Academic Press, San Diego, 1994.
J. Zimmermann, Mehrmaschinen-Schedulingprobleme mit GERT-Anordnungsbeziehungen, Ph.D. Thesis, Universität Fridericiana zu Karlsruhe, 1995.
Rights and permissions
About this article
Cite this article
Neumann, K., Zimmermann, J. Heuristic procedures for parallel-machine schedulingproblems with stochastic precedence constraints. Annals of Operations Research 83, 115–136 (1998). https://doi.org/10.1023/A:1018951828603
Issue Date:
DOI: https://doi.org/10.1023/A:1018951828603