Parallel machine scheduling problems with proportionally deteriorating jobs

Parallel machine scheduling problems with proportionally deteriorating jobs

0.00 Avg rating0 Votes
Article ID: iaor200972036
Country: United Kingdom
Volume: 40
Issue: 1
Start Page Number: 53
End Page Number: 57
Publication Date: Jan 2009
Journal: International Journal of Systems Science
Authors: , ,
Abstract:

This article considers two scheduling problems on parallel identical machines with deteriorating jobs, in which the processing time of job is proportional function of its starting times to be processed. Namely, for job j, pj = bjt, where bj > 0 is its deterioration rate, t = t0 > 0 is its starting time and t0 is a given constant. The criteria of optimality are minimising the makespan and maximising the minimum machine completion time. It has been proved that the first problem is NP-hard; we prove that the second problem is also NP-hard. For both problems heuristic algorithms are constructed and their performance is analysed.

Reviews

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