Scheduling on uniform parallel machines to minimize maximum lateness

Scheduling on uniform parallel machines to minimize maximum lateness

0.00 Avg rating0 Votes
Article ID: iaor20052158
Country: Netherlands
Volume: 26
Issue: 4
Start Page Number: 175
End Page Number: 179
Publication Date: May 2000
Journal: Operations Research Letters
Authors: ,
Abstract:

We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the earliest due date rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time.

Reviews

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