TY - JOUR
T1 - Scheduling with regular performance measures and optional job rejection on a single machine
AU - Mor, Baruch
AU - Shapira, Dana
N1 - Publisher Copyright:
© Operational Research Society 2019.
PY - 2020/8/2
Y1 - 2020/8/2
N2 - We address single machine problems with optional job rejection, and focus on minimizing regular performance measures, ie, functions that are non-decreasing in the jobs, completion times, subject to the constraint that the total rejection cost cannot exceed a predefined upper bound. Our contribution is twofold. First, we consider two problems that, to the best of our knowledge, were not addressed in scheduling theory–total (unweighted) tardiness with a common due date and total weighted tardiness with a common due date. For these problems, we show that they are NP-hard and present pseudo-polynomial-time dynamic programming (DP) solution algorithms. Second, we revisit three problems: makespan with release-dates, total completion time, and total weighted completion time, and present enhanced DP solution algorithms. To all studied problems, we provide extensive numerical studies, verifying their efficiency, subsequently demonstrating both theoretical and practical enhancement.
AB - We address single machine problems with optional job rejection, and focus on minimizing regular performance measures, ie, functions that are non-decreasing in the jobs, completion times, subject to the constraint that the total rejection cost cannot exceed a predefined upper bound. Our contribution is twofold. First, we consider two problems that, to the best of our knowledge, were not addressed in scheduling theory–total (unweighted) tardiness with a common due date and total weighted tardiness with a common due date. For these problems, we show that they are NP-hard and present pseudo-polynomial-time dynamic programming (DP) solution algorithms. Second, we revisit three problems: makespan with release-dates, total completion time, and total weighted completion time, and present enhanced DP solution algorithms. To all studied problems, we provide extensive numerical studies, verifying their efficiency, subsequently demonstrating both theoretical and practical enhancement.
KW - Scheduling
KW - dynamic programming
KW - job rejection
KW - numerical study
KW - regular measures
KW - single machine
UR - http://www.scopus.com/inward/record.url?scp=85069432301&partnerID=8YFLogxK
U2 - 10.1080/01605682.2019.1621222
DO - 10.1080/01605682.2019.1621222
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85069432301
SN - 0160-5682
VL - 71
SP - 1315
EP - 1325
JO - Journal of the Operational Research Society
JF - Journal of the Operational Research Society
IS - 8
ER -