haku: @author Johns, T. / yhteensä: 5
viite: 2 / 5
| Tekijä: | Brusco, M. Johns, T. |
| Otsikko: | A sequential integer programming method for discontinuous labor tour scheduling |
| Lehti: | European Journal of Operational Research
1996 : DEC 20, VOL. 95:3, p. 537-548 |
| Asiasana: | OPERATIONAL RESEARCH SCHEDULING SERVICE |
| Kieli: | eng |
| Tiivistelmä: | General set-covering formulations (GSCFs) of labour tour scheduling problems have recently received substantial attention in the research literature. The most successful heuristic approaches to these problems have used the linear programming (LP) solution to the GSCF as a starting point and subsequently applied heuristic augmentation and improvement procedures to obtain feasible integer solutions. Integer programming methods eliminate the need for augmentation and improvement procedures, but have generally been considered intractable for large GSCFs. |
SCIMA