Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

作者：Mor Baruch; Mosheiov Gur^*

来源：European Journal of Operational Research, 2010, 206(3): 540-546.

DOI：10.1016/j.ejor.2010.03.003

• Multi-agent scheduling
• Single machine
• Earliness

A relatively new class of scheduling problems consists of multiple agents who compete on the use of a common processor. We focus in this paper on a two-agent setting. Each of the agents has a set of jobs to be processed on the same processor, and each of the agents wants to minimize a measure which depends on the completion times of its own jobs. The goal is to schedule the jobs such that the combined schedule performs well with respect to the measures of both agents. We consider measures of minmax and minsum earliness. Specifically, we focus on minimizing maximum earliness cost or total (weighted) earliness cost of one agent, subject to an upper bound on the maximum earliness cost of the other agent. We introduce a polynomial-time solution for the minmax problem, and prove NP-hardness for the weighted minsum case. The unweighted minsum problem is shown to have a polynomial-time solution.

• 出版日期2010-11-1