TY - JOUR
T1 - Sequential scheduling on identical machines
AU - Hassin, Refael
AU - Yovel, Uri
N1 - Publisher Copyright:
© 2015 Elsevier B.V.
PY - 2015/9/1
Y1 - 2015/9/1
N2 - We study a sequential version of the KP-model: Each of n agents has a job to be processed on any of m machines. Agents sequentially select a machine for processing their jobs. The goal of each agent is to minimize the completion time of his machine. We study the sequential price of anarchy for m identical machines under arbitrary and LPT orders, and suggest insights into the case of two unrelated machines.
AB - We study a sequential version of the KP-model: Each of n agents has a job to be processed on any of m machines. Agents sequentially select a machine for processing their jobs. The goal of each agent is to minimize the completion time of his machine. We study the sequential price of anarchy for m identical machines under arbitrary and LPT orders, and suggest insights into the case of two unrelated machines.
KW - Congestion games
KW - Load balancing
KW - Machine scheduling
KW - Makespan minimization
KW - Sequential price of anarchy
KW - Subgame-perfect equilibrium
UR - http://www.scopus.com/inward/record.url?scp=84983358928&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2015.08.003
DO - 10.1016/j.orl.2015.08.003
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84983358928
SN - 0167-6377
VL - 43
SP - 530
EP - 533
JO - Operations Research Letters
JF - Operations Research Letters
IS - 5
ER -