Abstract
In this paper, we address the waterway ship scheduling problem (WSSP), which finds applications in the management of ship arrivals and departures at maritime ports near channels and waterways. It incorporates practically relevant conflicts which stem from tidal changes, curfews, ship properties or traffic. We propose a reformulation of the WSSP as a variant of the multi-mode resource-constrained project scheduling problem, which incorporates time-dependent resource capacities besides earliest and latest start times for the tasks. This problem is solved through integer programming, using a compact mathematical formulation. Our approach outperforms previous methods by solving all the existing literature instances to optimality. Most of them are solved at the root node within less than 2 s.
| Original language | English |
|---|---|
| Pages (from-to) | 1-10 |
| Number of pages | 10 |
| Journal | Journal of scheduling |
| DOIs | |
| Publication status | Published - 16 Jul 2018 |
Fingerprint
Keywords
- UT-Hybrid-D
- Mathematical programming
- Multi-mode resource-constrained project scheduling
- Time-dependent resource availability
- Waterway ship scheduling problem
- Optimization
- Transportation
- Integer Programming
- Maritime logistics
Cite this
}
A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem. / Hill, Alessandro (Corresponding Author); Lalla-Ruiz, Eduardo; Voβ, Stefan; Goycoolea, Marcos.
In: Journal of scheduling, 16.07.2018, p. 1-10.Research output: Contribution to journal › Article › Academic › peer-review
TY - JOUR
T1 - A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem
AU - Hill, Alessandro
AU - Lalla-Ruiz, Eduardo
AU - Voβ, Stefan
AU - Goycoolea, Marcos
N1 - Springer deal
PY - 2018/7/16
Y1 - 2018/7/16
N2 - In this paper, we address the waterway ship scheduling problem (WSSP), which finds applications in the management of ship arrivals and departures at maritime ports near channels and waterways. It incorporates practically relevant conflicts which stem from tidal changes, curfews, ship properties or traffic. We propose a reformulation of the WSSP as a variant of the multi-mode resource-constrained project scheduling problem, which incorporates time-dependent resource capacities besides earliest and latest start times for the tasks. This problem is solved through integer programming, using a compact mathematical formulation. Our approach outperforms previous methods by solving all the existing literature instances to optimality. Most of them are solved at the root node within less than 2 s.
AB - In this paper, we address the waterway ship scheduling problem (WSSP), which finds applications in the management of ship arrivals and departures at maritime ports near channels and waterways. It incorporates practically relevant conflicts which stem from tidal changes, curfews, ship properties or traffic. We propose a reformulation of the WSSP as a variant of the multi-mode resource-constrained project scheduling problem, which incorporates time-dependent resource capacities besides earliest and latest start times for the tasks. This problem is solved through integer programming, using a compact mathematical formulation. Our approach outperforms previous methods by solving all the existing literature instances to optimality. Most of them are solved at the root node within less than 2 s.
KW - UT-Hybrid-D
KW - Mathematical programming
KW - Multi-mode resource-constrained project scheduling
KW - Time-dependent resource availability
KW - Waterway ship scheduling problem
KW - Optimization
KW - Transportation
KW - Integer Programming
KW - Maritime logistics
UR - http://www.scopus.com/inward/record.url?scp=85049969869&partnerID=8YFLogxK
U2 - 10.1007/s10951-018-0578-9
DO - 10.1007/s10951-018-0578-9
M3 - Article
SP - 1
EP - 10
JO - Journal of scheduling
JF - Journal of scheduling
SN - 1094-6136
ER -