TY - JOUR
T1 - Scheduling jobs under simple linear deterioration
AU - Mosheiov, Gur
PY - 1994/7
Y1 - 1994/7
N2 - We consider simple linear deterioration of processing times, i.e. Pi = αit, where αi is a job dependent deterioration rate and t > 0 is the job's starting time. In this environment, we study most classical n-job, non-preemptive, single machine scheduling models, i.e. most commonly used performance measures are considered: makespan, flow-time, total tardiness, number of tardy jobs, etc. We show that all these models remain polynomially solvable.
AB - We consider simple linear deterioration of processing times, i.e. Pi = αit, where αi is a job dependent deterioration rate and t > 0 is the job's starting time. In this environment, we study most classical n-job, non-preemptive, single machine scheduling models, i.e. most commonly used performance measures are considered: makespan, flow-time, total tardiness, number of tardy jobs, etc. We show that all these models remain polynomially solvable.
UR - http://www.scopus.com/inward/record.url?scp=0028463787&partnerID=8YFLogxK
U2 - 10.1016/0305-0548(94)90080-9
DO - 10.1016/0305-0548(94)90080-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0028463787
SN - 0305-0548
VL - 21
SP - 653
EP - 659
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 6
ER -