Sequence dependent task extensions for trip scheduling
Number of Authors: 4
2001 (English)Report (Refereed)
A constraint model for scheduling train trips on a network of tracks used in both directions, using a headway abstraction is described. We argue that a generalisation of a straightforward job-shop scheduling formulation using sequence dependent task extensions can decrease the required resolution of network representation and hence problem size. A geometric interpretation of the model of the constraints that can be used to visualise schedules is presented. Preliminary ideas on search heuristics are presented with performance results and a set of examples.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2001, 1. , 21 p.
SICS Technical Report, ISSN 1100-3154 ; 2001:14
Constraint modeling, scheduling, sequence dependent durations, train scheduling, global constraints, scheduler implementation
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22107OAI: oai:DiVA.org:ri-22107DiVA: diva2:1041649