Acta Informatica

, Volume 39, Issue 8, pp 597–612 | Cite as

Ideal preemptive schedules on two processors

  • E. G. Coffman
  • J. Sethuraman
  • V. G. Timkovsky
Original Paper


An ideal schedule minimizes both makespan and total flow time. It is known that the Coffman-Graham algorithm [Acta Informatica 1, 200-213, 1972] solves in polynomial time the problem of finding an ideal nonpreemptive schedule of unit-execution-time jobs with equal release dates and arbitrary precedence constraints on two identical parallel processors. This paper presents an extension of the algorithm that solves in polynomial time the preemptive counterpart of this problem. The complexity status of the preemptive problem of minimizing just the total flow time has been open.


Polynomial Time Flow Time Release Date Total Flow Complexity Status 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2003

Authors and Affiliations

  • E. G. Coffman
    • 1
  • J. Sethuraman
    • 2
  • V. G. Timkovsky
    • 3
    • 4
  1. 1.Department of Electrical EngineeringColumbia UniversityNew YorkUSA
  2. 2.Department of Industrial Engineering & Operations ResearchColumbia UniversityNew YorkUSA
  3. 3.Department of Industrial Engineering & Operations ResearchCGI Group Inc.TorontoCanada 1G1
  4. 4.Department of Computing & SoftwareMcMaster UniversityHamiltonCanada

Personalised recommendations