haku: @indexterm Scheduling / yhteensä: 635
viite: 68 / 635
| Tekijä: | Fischetti, M. |
| Otsikko: | A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems |
| Lehti: | Management Science
2001 : JUN, VOL. 47:6, p. 833-850 |
| Asiasana: | SCHEDULING VEHICLE SCHEDULING OPERATIONS MANAGEMENT |
| Kieli: | eng |
| Tiivistelmä: | The authors consider the simplified but still NP-hard case in which several depots are specified, and limits on both the total time between the start and the end of any duty (spread time) and the total duty operational time (working time) are imposed. The authors give a 0-1 linear programming formulation based on binary variables associated with trip transitions, which applies to both crew and vehicle scheduling. The model is enhanced by means of new families of valid inequalities, for which exact and heuristic separation procedures are proposed. These techniques are embedded into an exact branch-and-cut algorithm, which also incorporates heuristic procedures. |
SCIMA