haku: @author Cao, B. / yhteensä: 2
viite: 2 / 2
« edellinen | seuraava »
| Tekijä: | Beasley, J. Cao, B. |
| Otsikko: | A tree search algorithm for the crew scheduling problem |
| Lehti: | European Journal of Operational Research
1996 : NOV 8, VOL. 94:3, p. 517-526 |
| Asiasana: | OPTIMIZATION SCHEDULING OPERATIONAL RESEARCH |
| Kieli: | eng |
| Tiivistelmä: | In this paper the authors consider the crew scheduling program, that is the problem of assigning K crews to N tasks with fixed start and finish times such that each crew does not exceed a limit on the total time it can spend working. A zero-one integer linear programming formulation of the problem is given, which is then relaxed in a lagrangean way to provide a lower bound which is improved by subgradient optimisation. Finally, a tree search procedure incorporating this lower bound is presented to solve the problem to optimality. |
« edellinen | seuraava »
SCIMA