The NP-completeness of the n/m /parallel/Cmax preemptive due-date scheduling problem

  • Authors:

  • T. C. E. Cheng;C. C. S. Sin

  • Affiliations:

  • Department of Actuarial and Management Sciences, University of Manitoba, Winnipeg, Manitoba R3T 2N2 Canada;Department of Actuarial and Management Sciences, University of Manitoba, Winnipeg, Manitoba R3T 2N2 Canada

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 1990

Quantified Score

Hi-index 0.98

Visualization

Abstract

We present a proof of the NP-completeness of the problem to schedule n simultaneously available jobs on m parallel machines to minimize the maximum job completion time subject to no jobs being tardy.