Preemptive scheduling of two uniform parallel machines to minimize total tardiness

0.00 Avg rating—0 Votes

Article ID:	iaor20121829
Volume:	219
Issue:	1
Start Page Number:	27
End Page Number:	33
Publication Date:	May 2012
Journal:	European Journal of Operational Research
Authors:	Lushchakova Irina N
Keywords:	combinatorial optimization

Abstract:

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 $Σ T_{i}$ equ1 . We suggest an O(n log n) algorithm to solve this problem.

Reviews

Required fields are marked *. Your email address will not be published.