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

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 N P -hard in the ordinary sense by showing that it is N P -hard, and deriv...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 37; no. 5; pp. 368 - 374
Main Authors Tian, Zhongjun, Ng, C.T., Cheng, T.C.E.
Format Journal Article
LanguageEnglish
Published Oxford Elsevier B.V 01.09.2009
Elsevier
Subjects
Applied sciences
Exact sciences and technology
Inventory control, production control. Distribution
Operational research and scientific management
Operational research. Management science
Preemptive scheduling
Scheduling, sequencing
Single machine
Total tardiness
Preemptive scheduling
Single machine
Total tardiness
Preemption
Task scheduling
Scheduling
Due date
Delay
Workload
Online AccessGet full text
ISSN0167-6377
1872-7468
DOI10.1016/j.orl.2009.04.004

Cover

More Information
Summary: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 N P -hard in the ordinary sense by showing that it is N P -hard, and deriving a pseudo-polynomial algorithm for it.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2009.04.004