Error bound for common due date assignment and job scheduling on parallel machines

Error bound for common due date assignment and job scheduling on parallel machines

0.00 Avg rating—0 Votes
Article ID: iaor2002722
Country: United States
Volume: 32
Issue: 5
Start Page Number: 445
End Page Number: 448
Publication Date: May 2000
Journal: IIE Transactions
Authors: ,
Abstract:

We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical machines so that the weighted sum of the due date, earliness and tardiness is approximately minimized. We alter the heuristic slightly and show that the revised version is asymptotically optimal as n → ∞.

Reviews

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