Acta Informatica

, Volume 39, Issue 8, pp 597–612

Ideal preemptive schedules on two processors

Authors

    • Department of Electrical EngineeringColumbia University
  • J. Sethuraman
    • Department of Industrial Engineering & Operations ResearchColumbia University
  • V. G. Timkovsky
    • Department of Industrial Engineering & Operations ResearchCGI Group Inc.
    • Department of Computing & SoftwareMcMaster University
Original Paper

DOI: 10.1007/s00236-003-0119-6

Cite this article as:
Coffman, E.G., Sethuraman, J. & Timkovsky, V.G. Acta Informatica (2003) 39: 597. doi:10.1007/s00236-003-0119-6

Abstract.

An ideal schedule minimizes both makespan and total flow time. It is known that the Coffman-Graham algorithm [Acta Informatica1, 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.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2003