haku: @author Neebe, A. W. / yhteensä: 8
viite: 3 / 8
| Tekijä: | Mazzola, J. B. Neebe, A. W. |
| Otsikko: | Resource-constrained assignment scheduling. |
| Lehti: | Operations Research
1986 : JUL-AUG, VOL. 34:4, p. 560-572 |
| Asiasana: | SCHEDULING |
| Kieli: | eng |
| Tiivistelmä: | A branch-and-bound algorithm is defined for solving assignment problems with side constraints /APSC/ to optimality. The algorithm employs a depth-first, polychotomous branching strategy in conjunction with a bounding procedure that utilizes subgradient optimalization. A heuristic procedure is also provided for obtaining approximate solutions to APSC. The heuristic uses subgradient optimalization to guide the search for a good solution quality. Computational experience is presented with both procedures,applied to over 400 test problems. The algorithm is demonstrated to be effective across three different classes of resource-constrained assignment scheduling problems. |
SCIMA