Change search
ReferencesLink to record
Permanent link

Direct link
Sequence dependent task extensions for trip scheduling
Number of Authors: 4
2001 (English)Report (Refereed)
Abstract [en]

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.
Series
SICS Technical Report, ISSN 1100-3154 ; 2001:14
Keyword [en]
Constraint modeling, scheduling, sequence dependent durations, train scheduling, global constraints, scheduler implementation
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22107OAI: oai:DiVA.org:ri-22107DiVA: diva2:1041649
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(2375 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 2375 kBChecksum SHA-512
399947b0b84a277d24134315360a25b9cc010428ef333e04324cc942c85220de0597db0762bf9faf126b67f950cdf576aa64ed3314ef2be8d1b570226b693918
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link