Abstract
An interesting variant of the assignment problem is the case where each partial assignment of an individual to a job involves multiple inputs and outputs. In this paper, three issues about this problem are discussed: finding an efficient assignment, verifying the efficiency of a solution and restoring the efficiency of an inefficient assignment. For the first issue, a current method, proposed by Chen and Lu, is compared with a proposed multiobjective formulation and for the second and third ones, a two-phase method is developed, which is based on the simplex method and the Dantzig-Wolfe decomposition algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 715-725 |
| Number of pages | 11 |
| Journal | International Journal of Computer Mathematics |
| Volume | 87 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2010 |