Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1995: Algorithms and Data Structures pp 86–97Cite as

Scheduling jobs that arrive over time

Extended abstract

  • Invited Presentation
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 955))

Abstract

A natural problem in scheduling theory is to provide good average quality of service to a stream of jobs that arrive over time. In this paper we consider the problem of scheduling n jobs that are released over time in order to minimize the average completion time of the set of jobs. In contrast to the problem of minimizing average completion time when all jobs are available at time 0, all the problems that we consider are NP-hard, and essentially nothing was known about constructing good approximations in polynomial time.

We give the first constant-factor approximation algorithms for several variants of the single and parallel machine model. Many of the algorithms are based on interesting algorithmic and structural relationships between preemptive and nonpreemptive schedules and linear programming relaxations of both. Many of the algorithms generalize to the minimization of average weighted completion time as well.

This work was performed under U.S. Department of Energy contract number DE-AC04-76AL85000.

Research partly supported by NSF Award CCR-9308701, a Walter Burke Research Initiation Award and a Dartmouth College Research Initiation Award.

Research partially supported by NSF Research Initiation Award CCR-9211494 and a grant from the New York State Science and Technology Foundation, through its Center for Advanced Technology in Telecommunications.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.

    Google Scholar 

  2. J. Bruno, E.G. Coffman Jr., and R. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17:382–387, 1974.

    Article  Google Scholar 

  3. J. Du, J.Y.-T. Leung, and G.H. Young. Minimizing mean flow time with release time constraints. Technical report, University of Texas at Dallas, 1988.

    Google Scholar 

  4. T. Gonzalez and S. Sahni. Open shop scheduling to minimize finish time. Journal of the ACM, 23:665–679, 1976.

    Article  Google Scholar 

  5. W. Horn. Minimizing average flow time with parallel machines. Operations Research, 21:846–847, 1973.

    Google Scholar 

  6. T. Kawaguchi and S. Kyan. Worst case bound of an lrf schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15:1119–1129, 1986.

    Article  Google Scholar 

  7. J. Labetoulle, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinooy Kan. Preemptive scheduling of uniform machines subject to release dates. In W.R. Pulleyblank, editor, Progress in Combinatorial Optimization, pp. 245–261. Academic Press, 1984.

    Google Scholar 

  8. E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, editors, Handbooks in Operations Research and Management Science, Vol 4., Logistics of Production and Inventory, pages pp 445–522. 1993.

    Google Scholar 

  9. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343–362, 1977.

    Google Scholar 

  10. R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6:1–12, 1959.

    Google Scholar 

  11. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pp. 422–431, Jan. 1993.

    Google Scholar 

  12. C. Phillips, C. Stein, and J. Wein. Task scheduling in networks. In Proceedings of Fourth Scandinavian Workshop on Algorithm Theory, pages 290–301, 1994.

    Google Scholar 

  13. W.E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sandia National Labs, Albuquerque, NM, USA

    Cynthia Phillips

  2. Department of Computer Science, Dartmouth College, Hanover, NH, USA

    Clifford Stein

  3. Department of Computer Science, Polytechnic University, Brooklyn, NY, USA

    Joel Wein

Authors
  1. Cynthia Phillips
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Clifford Stein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joel Wein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Selim G. Akl Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Phillips, C., Stein, C., Wein, J. (1995). Scheduling jobs that arrive over time. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-60220-8_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60220-0

  • Online ISBN: 978-3-540-44747-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation