haku: @author Chuin Lau, H. / yhteensä: 1
viite: 1 / 1
« edellinen | seuraava »
| Tekijä: | Chuin Lau, H. |
| Otsikko: | Combinational approaches for hard problems in manpower scheduling |
| Lehti: | Journal of the Operational Research Society
1996 : MAR, VOL. 39:1, p. 88-98 |
| Asiasana: | LABOUR SUPPLY SCHEDULING ECONOMICS |
| Kieli: | eng |
| Tiivistelmä: | Manpower scheduling is concerned with the construction of a workers' schedule which meets demands while satisfying given constraints. The author considers a manpower scheduling problem, called the Change Shift Assignment Problem (CSAP). In previous work the author proved that CSAP is NP-hard and presented greedy methods to solve some restricted versions. In this paper, the author presents combinatorial algorithms to solve more general and realistic versions of CSAP which are unlikely solvable by greedy methods. |
« edellinen | seuraava »
SCIMA