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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research letters Ročník 37; číslo 5; s. 368 - 374
Hlavní autoři: Tian, Zhongjun, Ng, C.T., Cheng, T.C.E.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier B.V 01.09.2009
Elsevier
Témata:
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
ISSN:0167-6377, 1872-7468
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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