Skip to main content
SpringerLink
Log in

heuristics for parallel machine scheduling with delivery times

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

A parallel machine scheduling problem is considered in which each job has a processing time and a delivery time. The objective is to find a schedule which minimizes the time by which all jobs are delivered. For a single machine this problem is easily solved in polynomial time, form≥2 machines it becomes NP-hard. Several heuristics using list scheduling as a subroutine are proposed and a tight worst-case analysis is given. The best one of our heuristics has a worst-case performance guarantee of 2−2/(m+1). For the on-line case we give a heuristic with the (best possible) worst-case performance of two.

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. Baker, K.R.: Introduction to sequencing and scheduling. New York: Wiley 1974

    Google Scholar 

  2. Ben-Or, M.: Lower bounds for algebraic computation trees. Proc. 15th Annual Symp. on Theory of Computing. 1983, pp. 80–86

  3. Fisher, M.L.: Worst-case analysis of heuristic algorithms. Manag. Sci.,26, 1–17 (1980)

    Google Scholar 

  4. Garey, M.R., Graham, R. L., Johnson, D.S.: Performance guarantees for scheduling algorithms. Oper. Res.26, 3–21 (1978)

    Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-dompleteness. San Francisco: Freeman 1979

    Google Scholar 

  6. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J.45, 1563–1581 (1966)

    Google Scholar 

  7. Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math.17, 263–269 (1969)

    Google Scholar 

  8. Hall, L.A., Shmoys, D.B.: Jackson's rule for one machine scheduling: Making a good heuristic better. Department of Mathematics, Massachusetts Institute of Technology, 1988

  9. Hall, L.A., Shmoys, D.B.: Approximation schemes for constrained scheduling problems. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 134–140

  10. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Theoretical and practical result. J. ACM34, 144–162 (1987)

    Google Scholar 

  11. Lee, D.T., Wu, Y.F.: Geometric complexity and some location problems. Algorithmica1, 193–211 (1986)

    Google Scholar 

  12. Potts, C.N.: Analysis of a heuristic for one machine sequencing with release dates and delivery times. Oper. Res.28, 1436–1441 (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Grundlagen der Informationsverarbeitung, TU Graz, Klosterwiesgasse 32, A-8010, Graz, Austria

    Gerhard J. Woeginger

Authors
  1. Gerhard J. Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the Christian Doppler Laboratorium für Diskrete Optimierung.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Woeginger, G.J. heuristics for parallel machine scheduling with delivery times. Acta Informatica 31, 503–512 (1994). https://doi.org/10.1007/BF01213203

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation