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.
|Number of pages||11|
|Journal||Leibniz International Proceedings in Informatics, LIPIcs|
|State||Published - 1 Nov 2015|
|Event||10th International Symposium on Parameterized and Exact Computation, IPEC 2015 - Patras, Greece|
Duration: 16 Sep 2015 → 18 Sep 2015
- Multiagent scheduling
- Parameterized complexity