Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness

  • Authors:

  • Zhongjun Tian;C. T. Ng;T. C. E. Cheng

  • Affiliations:

  • Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hong Kong, China and School of International Business Administration, Shanghai University of Finance and Economi ...;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hong Kong, China;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hong Kong, China

  • Venue:
  • Operations Research Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of scheduling n preemptive jobs on a single machine to minimize total tardiness, subject to agreeable due dates, i.e., a later release date corresponds to a later due date. We prove that the problem is NP-hard in the ordinary sense by showing that it is NP-hard, and deriving a pseudo-polynomial algorithm for it.