TY - GEN
T1 - Scheduling two competing agents when one agent has significantly fewer jobs
AU - Hermelin, Danny
AU - Kubitza, Judith Madeleine
AU - Shabtay, Dvir
AU - Talmon, Nimrod
AU - Woeginger, Gerhard
N1 - Publisher Copyright:
© Danny Hermelin, Judith Kubitza, Dvir Shabtay, Nimrod Talmon, and Gerhard Woeginger;.
PY - 2015/11/1
Y1 - 2015/11/1
N2 - We study a scheduling problem where two agents (each equipped with a private set of jobs) compete to perform their respective jobs on a common single machine. Each agent wants to keep the weighted sum of completion times of his jobs below a given (agent-dependent) bound. This problem is known to be NP-hard, even for quite restrictive settings of the problem parameters. We consider parameterized versions of the problem where one of the agents has a small number of jobs (and where this small number constitutes the parameter). The problem becomes much more tangible in this case, and we present three positive algorithmic results for it. Our study is complemented by showing that the general problem is NP-complete even when one agent only has a single job.
AB - We study a scheduling problem where two agents (each equipped with a private set of jobs) compete to perform their respective jobs on a common single machine. Each agent wants to keep the weighted sum of completion times of his jobs below a given (agent-dependent) bound. This problem is known to be NP-hard, even for quite restrictive settings of the problem parameters. We consider parameterized versions of the problem where one of the agents has a small number of jobs (and where this small number constitutes the parameter). The problem becomes much more tangible in this case, and we present three positive algorithmic results for it. Our study is complemented by showing that the general problem is NP-complete even when one agent only has a single job.
KW - Multiagent scheduling
KW - Parameterized complexity
UR - http://www.scopus.com/inward/record.url?scp=84958232398&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.IPEC.2015.55
DO - 10.4230/LIPIcs.IPEC.2015.55
M3 - Conference contribution
AN - SCOPUS:84958232398
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 55
EP - 65
BT - 10th International Symposium on Parameterized and Exact Computation, IPEC 2015
A2 - Husfeldt, Thore
A2 - Husfeldt, Thore
A2 - Kanj, Iyad
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 10th International Symposium on Parameterized and Exact Computation, IPEC 2015
Y2 - 16 September 2015 through 18 September 2015
ER -