TY - JOUR
T1 - Minimizing maximum cost on a single machine with two competing agents and job rejection
AU - Mor, Baruch
AU - Mosheiov, Gur
N1 - Publisher Copyright:
© 2016 The OR Society.
PY - 2016/12/1
Y1 - 2016/12/1
N2 - The classical Lawler's Algorithm provides an optimal solution to the single-machine scheduling problem, where the objective is minimizing maximum cost, given general non-decreasing, job-dependent cost functions, and general precedence constraints. First, we extend this algorithm to allow job rejection, where the scheduler may decide to process only a subset of the jobs. Then, we further extend the model to a setting of two competing agents, sharing the same processor. Both extensions are shown to be solved in polynomial time.
AB - The classical Lawler's Algorithm provides an optimal solution to the single-machine scheduling problem, where the objective is minimizing maximum cost, given general non-decreasing, job-dependent cost functions, and general precedence constraints. First, we extend this algorithm to allow job rejection, where the scheduler may decide to process only a subset of the jobs. Then, we further extend the model to a setting of two competing agents, sharing the same processor. Both extensions are shown to be solved in polynomial time.
KW - job rejection
KW - minmax
KW - precedence constraints
KW - scheduling
KW - single machine
KW - two agents
UR - http://www.scopus.com/inward/record.url?scp=85016174974&partnerID=8YFLogxK
U2 - 10.1057/s41274-016-0003-8
DO - 10.1057/s41274-016-0003-8
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85016174974
SN - 0160-5682
VL - 67
SP - 1524
EP - 1531
JO - Journal of the Operational Research Society
JF - Journal of the Operational Research Society
IS - 12
ER -