Skip to main content
SpringerLink
Log in

Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines

  • Chapter 3 Production Scheduling
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We propose a heuristic procedure that constructs a schedule forN jobs with stochastic processing times and a common due date onM parallel, identical machines. The criterion is the minimization of the total expected incompletion cost. A worst-case analysis for the ratio of the heuristic and optimal solutions is presented and a bound on the ratio is derived. The experimental results presented indicate that the heuristic procedure generates almost optimal solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.L. Bruno and P.J. Downey, Probabilistic bounds on the performance of list scheduling, SIAM Journal on Computing 15, No. 2 (1986) 409–417.

    Google Scholar 

  2. E.G. Coffman and E.N. Gilbert, On the expected relative performance of list scheduling, Operations Research 33, No. 3 (1985) 548–561.

    Google Scholar 

  3. A. Dogramaci and J. Surkis, Evaluation of a heuristic for scheduling independent jobs on parallel identical processors, Management Science 25, No. 12 (1979) 1208–1216.

    Google Scholar 

  4. W.L. Eastman, S. Even and I.M. Isaacs, Bounds for the optimal scheduling ofn jobs onm processors, Management Science 11, No. 2 (1964) 268–279.

    Google Scholar 

  5. S.E. Elmaghraby and S.H. Park, Scheduling jobs on a number of identical machines, AIIE Transactions 6, No. 1 (1974) 113.

    Google Scholar 

  6. E. Erel and S.C. Sarin, A methodology to solve single-model, stochastic assembly line balancing problems, Working paper, 1987.

  7. M.R. Garey and R.L. Graham, Bounds for multiprocessor scheduling with resource constraints, SIAM Journal on Computing 4, No. 2 (1975) 187–200.

    Google Scholar 

  8. M.R. Garey and D.S. Johnson, Two-processor scheduling with start-times and deadlines, SIAM Journal on Computing 6, No. 3 (1977) 416–426.

    Google Scholar 

  9. K.D. Glazebrook, Scheduling tasks with exponential service times on parallel processors, Journal of Applied Probability, 16, No. 3 (1979) 685–689.

    Google Scholar 

  10. R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM Journal on Applied Mathematics 17, No. 2 (1969) 416–429.

    Google Scholar 

  11. R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnoy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey (Stichting Mathematisch Centrum, Amsterdam, 1977).

    Google Scholar 

  12. J.N.D. Gupta and A.R. Maykut, Scheduling jobs on parallel processors with dynamic programming, Decision Sciences 4 (1973) 447–457.

    Google Scholar 

  13. R. Loulou, Tight bounds and probabilistic analysis of two heuristics for parallel processor scheduling, Mathematics of Operations Research 9, No. 1 (1984) 142–150.

    Google Scholar 

  14. R. McNaughton, Scheduling with deadlines and loss functions, Management Science 26 (1959) 1–12.

    Google Scholar 

  15. M. Pinedo, Stochastic scheduling with release dates and due dates, Operations Research 31, No. 3 (1983) 559–572.

    Google Scholar 

  16. M. Pinedo and G. Weiss, Scheduling jobs with exponentially distributed processing times and two machines with resource constraints, Management Science 30, No. 7 (1984) 883–889.

    Google Scholar 

  17. J.G. Root, Scheduling with deadlines and loss functions onk parallel machines, Management Science 11, No. 3 (1965) 460–475.

    Google Scholar 

  18. M.H. Rothkoph, Scheduling independent tasks on parallel processes, Management Science, 12, No. 5 (1966) 437–447.

    Google Scholar 

  19. S. Sahni, Preemptive scheduling with due dates, Operations Research 27, No. 5 (1979) 925–934.

    Google Scholar 

  20. S.C. Sarin and S.E. Elmaghraby, Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines, International Journal of Production Research 22, No. 1 (1984) 17–30.

    Google Scholar 

  21. S.C. Sarin and E. Erel, Sequencing jobs on a single machine with a common due date and stochastic processing times, Working paper, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, 1987.

    Google Scholar 

  22. R.R. Weber, Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime, Journal of Applied Probability 19, No. 1 (1982) 167–182.

    Google Scholar 

  23. W.E. Wilhelm, On the normality of operation times in small-lot assembly systems: a technical note, International Journal of Production Research 25, No. 1 (1987) 145–149.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, 24061, Blacksburg, Virginia, U.S.A.

    Erdal Erel & Subhash C. Sarin

  2. Department of Management, Bilkent University, P.O. Box 8,06572, Maltepe, Ankara, Turkey

    Erdal Erel

Authors
  1. Erdal Erel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subhash C. Sarin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erel, E., Sarin, S.C. Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines. Ann Oper Res 17, 181–198 (1989). https://doi.org/10.1007/BF02096604

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02096604

Keywords

Search

Navigation