TY - JOUR
T1 - Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times
AU - Mor, Baruch
AU - Mosheiov, Gur
N1 - Funding Information:
This paper was supported in part by The Recanati Fund and The Charles Rosen Chair of Management, The Hebrew University, Jerusalem, Israel.
PY - 2012/5
Y1 - 2012/5
N2 - We study a single machine scheduling problem, where the machine is unavailable for processing for a pre-specified time period. We assume that job processing times are position-dependent. The objective functions considered are minimum makespan, minimum total completion time and minimum number of tardy jobs. All these problems are known to be NP-hard even without position-dependent processing times. For all three cases we introduce simple heuristics which are based on solving the classical assignment problem. Lower bounds, worst case analysis and asymptotic optimality are discussed. All heuristics are shown numerically to perform extremely well.
AB - We study a single machine scheduling problem, where the machine is unavailable for processing for a pre-specified time period. We assume that job processing times are position-dependent. The objective functions considered are minimum makespan, minimum total completion time and minimum number of tardy jobs. All these problems are known to be NP-hard even without position-dependent processing times. For all three cases we introduce simple heuristics which are based on solving the classical assignment problem. Lower bounds, worst case analysis and asymptotic optimality are discussed. All heuristics are shown numerically to perform extremely well.
KW - Heuristics
KW - Makespan
KW - Number of tardy jobs
KW - Single machine scheduling
KW - Total completion time
KW - Unavailability period
UR - http://www.scopus.com/inward/record.url?scp=84858706179&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2011.12.013
DO - 10.1016/j.cie.2011.12.013
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84858706179
SN - 0360-8352
VL - 62
SP - 908
EP - 916
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
IS - 4
ER -