Preemptive scheduling of two uniform parallel machines to minimize total tardiness

We consider the problem of preemptive scheduling n jobs on two uniform parallel machines. All jobs have equal processing requirements. For each job we are given its due date. The objective is to find a schedule minimizing total tardiness ∑Ti. We suggest an O(nlogn) algorithm to solve this problem.

MoreLess

Year of publication:	2012
Authors:	Lushchakova, Irina N.
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 219.2012, 1, p. 27-33
Publisher:	Elsevier
Subject:	Scheduling \| Uniform machines \| Total tardiness \| Polynomial algorithm

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011052665