Skip to main content
SpringerLink
Log in
Book cover

Deterministic and Stochastic Scheduling pp 89–99Cite as

Scheduling Uniform Machines with Release Times, Deadlines and Due Times

  • Conference paper

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 84))

Abstract

Given n jobs each of which has a release time, a deadline, and a processing requirement, we examine the problem of determining whether there exists a preemptive schedule on m uniform machines which completes each job in the time interval between its release time and its deadline. An 0((m+1ogn) (m2n2+n4)) algorithm is presented which uses a polymatroidal flow network to construct such a schedule whenever one exists. This algorithm is then used with search techniques to find a schedule which minimizes maximum lateness.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Bruno, T. Gonzalez (1976) Scheduling independent tasks with release dates and due dates on parallel machines. Technical Report 213, Computer Science Department, Pennsylvania State University.

    Google Scholar 

  2. T. Gonzalez, S. Sahni (1976) Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach. 23, 665–679.

    MathSciNet  MATH  Google Scholar 

  3. T. Gonzalez, S. Sahni (1978) Preemptive scheduling of uniform processor systems. J. Assoc. Comput. Mach. 25, 92–101.

    MathSciNet  MATH  Google Scholar 

  4. W. Horn (1974) Some simple scheduling algorithms. Naval Res. Logist. Quart. 21, 177–185.

    Article  MathSciNet  MATH  Google Scholar 

  5. E.C. Horvath, S. Lam, R. Sethi (1977) A level algorithm for preemptive scheduling. J. Assoc. Comput. Mach. 25, 32–43.

    MathSciNet  Google Scholar 

  6. J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan (1979) Preemptive scheduling of uniform machines subject to release dates. Report BW 99, Mathematisch Centrum, Amsterdam.

    Google Scholar 

  7. E.L. Lawler, C.U. Martel (1980) Computing maximal “poly-matroidal” network flows. Research Memorandum ERL M80/52, Electronics Research Laboratory, University of California, Berkeley.

    Google Scholar 

  8. C. Martel (1981) Preemptive scheduling with release times, deadlines and due times. J. Assoc. Comput. Mach., to appear.

    Google Scholar 

  9. C. Papadimitriou (1979) Efficient search for rationals. Inform. Process. Lett. 8, 1–9.

    Article  MathSciNet  MATH  Google Scholar 

  10. S. Sahni, Y. Cho (1980) Scheduling independent tasks with due times on a uniform processor system. J. Assoc. Comput. Mach. 27, 550–563.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Davis, USA

    Charles Martel

Authors
  1. Charles Martel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada

    M. A. H. Dempster

  2. Balliol College, Oxford, England

    M. A. H. Dempster

  3. Mathematisch Centrum, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands

    J. K. Lenstra

  4. Econometric Institute H2-11, Erasmus University, P.O. Box 1738, 3000 DR, Rotterdam, The Netherlands

    A. H. G. Rinnooy Kan

Rights and permissions

Reprints and permissions

Copyright information

© 1982 D. Reidel Publishing Company

About this paper

Cite this paper

Martel, C. (1982). Scheduling Uniform Machines with Release Times, Deadlines and Due Times. In: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds) Deterministic and Stochastic Scheduling. NATO Advanced Study Institutes Series, vol 84. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7801-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7801-0_5

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-7803-4

  • Online ISBN: 978-94-009-7801-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation