A note on parallel-machine scheduling with deteriorating jobs

A note on parallel-machine scheduling with deteriorating jobs

0.00 Avg rating0 Votes
Article ID: iaor20082425
Country: United Kingdom
Volume: 58
Issue: 6
Start Page Number: 824
End Page Number: 826
Publication Date: Jun 2007
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

We consider a parallel-machine scheduling problem of minimizing the total completion time. The processing time of a job is a linear function of its starting time and deterioration rate. This problem is known to be NP-hard, even for the case with two machines. In this note, we generalize an existing lower bound for the two-machine case to the general case with an arbitrary number of machines. Despite the generalization concerning machine number, our bound has one extra term that makes our bound tighter than the existing one.

Reviews

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