A combinatorial benders' cuts algorithm for the quayside operation problem at container terminals
Year of publication: |
2012
|
---|---|
Authors: | Chen, Jiang Hang ; Lee, Der-Horng ; Cao, Jin Xin |
Published in: |
Transportation research / E : an international journal. - Amsterdam : Elsevier, ISSN 1366-5545, ZDB-ID 1380969-6. - Vol. 48.2012, 1, p. 266-275
|
Subject: | Containerterminal | Container terminal | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Containerverkehr | Container transport | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Theorie | Theory |
-
Tanaka, Shunji, (2018)
-
Interference aware scheduling of triple-crossover-cranes
Briskorn, Dirk, (2020)
-
Ozturk, Onur, (2017)
- More ...
-
The continuous Berth Allocation problem : a greedy randomized adaptive search solution
Lee, Der-Horng, (2010)
-
The integrated yard truck and yard crane scheduling problem : Benders’ decomposition-based methods
Cao, Jin Xin, (2010)
-
A heuristic algorithm for yard truck scheduling and storage allocation problems
Lee, Der-Horng, (2009)
- More ...