Article ID: | iaor20072056 |
Country: | Germany |
Volume: | 147 |
Issue: | 1 |
Start Page Number: | 287 |
End Page Number: | 316 |
Publication Date: | Oct 2006 |
Journal: | Annals of Operations Research |
Authors: | Roy Bernard, Slowinski Roman |
Keywords: | programming: multiple criteria |
The considered assignment problem generalizes its classical counterpart by the existence of some incompatibility constraints limiting the assignment of tasks to processing units within groups of mutually exclusive tasks. The groups are defined for each processing unit and the constraints allow at most one task from each group to be assigned to the corresponding processing unit. The processing units can normally process a certain number of tasks without any cost; this capacity can be extended, however, at some extra marginal cost that is non-decreasing with the number of additional tasks. Each task has to be assigned to exactly one processing unit and has some preference for the assignment; it is expressed for each pair ‘task-processing unit’ by a dissatisfaction degree. The quality of feasible assignments is evaluated by three criteria: