Change search
ReferencesLink to record
Permanent link

Direct link
Mixed integer-linear formulations of cumulative scheduling constraints - A comparative study
Number of Authors: 3
2007 (English)Report (Refereed)
Abstract [en]

This paper introduces two MILP models for the cumulative scheduling constraint and associated pre-processing filters. We compare standard solver performance for these models on three sets of problems and for two of them, where tasks have unitary resource consumption, we also compare them with two models based on a geometric placement constraint. In the experiments, the solver performance of one of the cumulative models, is clearly the best and is also shown to scale very well for a large scale industrial transportation scheduling problem.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2007, 1. , 12 p.
Series
SICS Technical Report, ISSN 1100-3154 ; 2007:03
Keyword [en]
Cumulative scheduling, MILP modelling and pre-processing, Railway transport scheduling
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22121OAI: oai:DiVA.org:ri-22121DiVA: diva2:1041663
Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

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

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: 8 hits
ReferencesLink to record
Permanent link

Direct link