TY - JOUR

T1 - The resource dependent assignment problem with a convex agent cost function

AU - Yedidsion, Liron

AU - Shabtay, Dvir

N1 - Publisher Copyright:
© 2017 Elsevier B.V.

PY - 2017/9/1

Y1 - 2017/9/1

N2 - We study the resource dependent assignment problem (RDAP), for which the cost of assigning agent j to task i is a multiplication of task i's cost parameter by a cost function of agent j, which is a convex function of the amount of resource allocated for the agent to execute his task. The quality of a solution is measured by two criteria. The first is the total assignment cost, and the second is the total weighted resource consumption. We consider four different variations of the RDAP and prove that three are NP-hard, while the last is polynomially solvable under some acceptable assumptions. In our NP-hardness proof we use a very general instance which makes the proof applicable to a large set of special cases of the RDAP, including several important scheduling problems whose complexity was unresolved heretofore. In addition, we design a novel approximation algorithm for one of the NP-hard variations of the RDAP with a very tight approximation ratio for any practical problem found in the literature.

AB - We study the resource dependent assignment problem (RDAP), for which the cost of assigning agent j to task i is a multiplication of task i's cost parameter by a cost function of agent j, which is a convex function of the amount of resource allocated for the agent to execute his task. The quality of a solution is measured by two criteria. The first is the total assignment cost, and the second is the total weighted resource consumption. We consider four different variations of the RDAP and prove that three are NP-hard, while the last is polynomially solvable under some acceptable assumptions. In our NP-hardness proof we use a very general instance which makes the proof applicable to a large set of special cases of the RDAP, including several important scheduling problems whose complexity was unresolved heretofore. In addition, we design a novel approximation algorithm for one of the NP-hard variations of the RDAP with a very tight approximation ratio for any practical problem found in the literature.

KW - Approximation algorithm

KW - Assignment problem

KW - Bicriteria optimization

KW - Controllable processing times

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=85015729279&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2017.03.004

DO - 10.1016/j.ejor.2017.03.004

M3 - Article

AN - SCOPUS:85015729279

VL - 261

SP - 486

EP - 502

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -