Resource assignment with preference conditions
This paper deals with a modification of the standard assignment problem, where subsets of resources express preferences in being, or not being, assigned together to the same activity. The problem arises in several real settings, among which the job assignment of the crew personnel of an airline company. We provide an integer programming formulation for both the Split Preference Problem, where couples of assignees do not want to work together, and for the Join Preference Problem, where, oppositely, couples of assignees want to work together. The mathematical nature of the two problems is indeed different, as for the first one it is possible to determine a minimum cost flow formulation on a suitable graph, and thus a polynomial time algorithm, while for the second one we face a NP-hard problem and device some heuristic solution approaches. Experimental tests conducted on instances of variable size confirm the effectiveness of the models and of the algorithms proposed.
assignment problem integer programming minimum cost flow