MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem
Year of publication: |
1 January 2018
|
---|---|
Authors: | Agra, Agostinho ; Oliveira, Maryse |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 264.2018, 1 (1.1.), p. 138-148
|
Subject: | Berth allocation | Quay crane scheduling | Mixed integer formulations | Branch and cut | Rolling horizon heuristic | Scheduling-Verfahren | Scheduling problem | Containerterminal | Container terminal | Heuristik | Heuristics | Kran | Crane | Ganzzahlige Optimierung | Integer programming | Hafenanlagen | Port facilities |
-
Cheimanoff, Nicolas, (2022)
-
New exact methods for the time-invariant berth allocation and quay crane assignment problem
Correcher, Juan F., (2019)
-
The berth allocation and quay crane assignment problem with crane travel and setup times
Correcher, Juan F., (2024)
- More ...
-
The minimum cost network upgrade problem with maximum robustness to multiple node failures
Barbosa, Fábio, (2021)
-
Robust formulations for economic lot-sizing problem with remanufacturing
Attila, Öykü Naz, (2021)
-
Robust inventory theory with perishable products
Santos, Marcio Costa, (2020)
- More ...