[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Scheduling jobs with equal processing times and time windows on identical parallel machines

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

We present a linear programming approach to the problem of scheduling equal processing time jobs with release dates and deadlines on identical parallel machines. The known algorithm with complexity O(n 3log log n) of B. Simons schedules all the jobs while minimizing both the maximum completion time and the mean flow time. Our approach permits also to minimize the weighted sum of completion times and total tardiness in polynomial time for the problems without deadlines. The complexity status of these problems was open.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103, 21–32, 2000.

    Article  Google Scholar 

  • Brucker, P., & Kravchenko, S. A. (2005). Scheduling jobs with release times on parallel machines to minimize total tardiness. Reihe P Preprints, Heft 258, Osnabrücker Schriften zur Mathematik, Fachbereich Mathematik/Informatik, Universität Osnabrück.

  • Kravchenko, S. A. (2000). On the complexity of minimizing the number of late jobs in unit time open shop. Discrete Applied Mathematics, 100, 127–132.

    Article  Google Scholar 

  • Simons, B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing, 12, 294–299.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Osnabrück, 49069, Osnabrück, Germany

    Peter Brucker

  2. United Institute of Informatics Problems, Surganova St. 6, 220012, Minsk, Belarus

    Svetlana A. Kravchenko

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Svetlana A. Kravchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Svetlana A. Kravchenko.

Additional information

Contract/grant sponsor: Alexander von Humboldt Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Kravchenko, S.A. Scheduling jobs with equal processing times and time windows on identical parallel machines. J Sched 11, 229–237 (2008). https://doi.org/10.1007/s10951-008-0063-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-008-0063-y

Keywords

Search

Navigation