TY - JOUR
T1 - Minimizing total load on parallel machines with linear deterioration
AU - Mor, Baruch
AU - Mosheiov, Gur
N1 - Publisher Copyright:
© 2020, Springer-Verlag GmbH Germany, part of Springer Nature.
PY - 2020/4/1
Y1 - 2020/4/1
N2 - We study a scheduling problem with linear deterioration of job processing times. We consider parallel identical machines. The objective is minimum total load, i.e., minimum total processing times on all the machines. We propose a simple heuristic of a greedy type for this NP-hard problem. A lower bound based on the geometric mean of the job deterioration factors is also introduced. The greedy heuristic is shown to guarantee an optimal solution for small size problems, and our numerical tests indicate that in general it produces very close-to-optimal schedules.
AB - We study a scheduling problem with linear deterioration of job processing times. We consider parallel identical machines. The objective is minimum total load, i.e., minimum total processing times on all the machines. We propose a simple heuristic of a greedy type for this NP-hard problem. A lower bound based on the geometric mean of the job deterioration factors is also introduced. The greedy heuristic is shown to guarantee an optimal solution for small size problems, and our numerical tests indicate that in general it produces very close-to-optimal schedules.
KW - Greedy heuristic
KW - Linear deterioration
KW - Parallel machines
KW - Scheduling
KW - Total load
UR - http://www.scopus.com/inward/record.url?scp=85077250272&partnerID=8YFLogxK
U2 - 10.1007/s11590-019-01526-6
DO - 10.1007/s11590-019-01526-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85077250272
SN - 1862-4472
VL - 14
SP - 771
EP - 779
JO - Optimization Letters
JF - Optimization Letters
IS - 3
ER -