Change search
ReferencesLink to record
Permanent link

Direct link
A constraint model for a cyclic time personnel routing and scheduling problem
RISE, Swedish ICT, SICS. RISE, Swedish ICT, SICS.
RISE, Swedish ICT, SICS. RISE, Swedish ICT, SICS.
Number of Authors: 2
2001 (English)Report (Refereed)
Abstract [en]

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
Keyword [en]
Crew scheduling, time windows, cyclic time, resource assignment
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-22115OAI: diva2:1041657
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(215 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 215 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Kreuger, Per
By organisation
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 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