Skip to main content
Log in

Ideal preemptive schedules on two processors

  • Original Paper
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

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.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. G. Coffman.

Additional information

Received: 2 May 2003,

J. Sethuraman: Research supported by an NSF CAREER Award DMI-0093981 and an IBM Faculty Partnership Award.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Coffman, E.G., Sethuraman, J. & Timkovsky, V.G. Ideal preemptive schedules on two processors. Acta Informatica 39, 597–612 (2003). https://doi.org/10.1007/s00236-003-0119-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-003-0119-6

Keywords

Navigation