Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Abstract

a b s t r a c tWe extend the classical linear assignment problem to the case where 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. The cost function of agent j is a linear function of the amount of resource allocated to the agent. A solution for our assignment problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second is the total weighted resource consumption. We address these criteria via four different problem variations. We prove that our assignment problem is N P -hard for three of the four variations, even if all the resource consumption weights are equal. However, and somewhat surprisingly, we find that the fourth variation is solvable in polynomial time. In addition, we find that our assignment problem is equivalent to a large set of important scheduling problems whose complexity has been an open question until now, for three of the four variations.

An Efficient Multiobjective Backtracking Search Algorithm for Single Machine Scheduling with Controllable Processing Times

“…Kayvanfar et al [26,27] extended the work of Tseng et al [25] by designing a net benefit compression-net benefit expansion (NBC-NBE) algorithm. Yedidsion et al [28] proved the complexity of a single machine scheduling problem with CPT for several related criteria. Yin et al [29] addressed a single machine batch delivery scheduling problem with an assignable common due date and CPT.…”

Two-machine flowshop scheduling with flexible operations and controllable processing times

“…Karabati and Kouvelis [6] discussed simultaneous scheduling and optimal processing time decision problem for a multi-product, deterministic flow line operated under a cyclic scheduling approach. Yedidsion et al [18] considered a bicriteria scheduling problem of controllable assignment costs and total resource consumption. Wang and Wang [17] studied a single machine scheduling problem to minimize total convex resource consumption cost for a given upper bound on the total weighted flow time.…”