A constraint model for a cyclic time personnel routing and scheduling problem
Number of Authors: 2
2001 (English)Report (Refereed)
We present a crew scheduling problem with time windows in the context of scheduling train personnel, which encompasses not only assignment of resources to tasks but also the introduction of extra tasks, passive journeys, depending on the problem instance. The representation of the problem is made as a constraint program, which relies heavily on some global constraints, notably a constraint for expressing non-overlap between rectangles on a surface. A search algorithm is described and we also point out some problems and deficiencies of the current model and its computational behaviour.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2001, 6. , 14 p.
SICS Technical Report, ISSN 1100-3154 ; 2001:04
Crew scheduling, time windows, cyclic time, resource assignment
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-14303OAI: oai:DiVA.org:ri-14303DiVA: diva2:1035591