Name
Title | ||
|---|---|---|
Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. |
Abstract | ||
|---|---|---|
•We model a berth allocation, crane assignment and scheduling problem (BACASP).•We devise a MILP formulation for the problem and propose a decomposition algorithm.•Our method can deal with time-variant crane assignments and crane setup costs.•We investigate NP-completeness of the crane scheduling subproblem.•BACASP can be solved optimally for up to 60 vessels using our approach. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.ejor.2016.04.022 | European Journal of Operational Research |
Keywords | Field | DocType |
Integer programming,Container terminal management,Berth allocation,Crane assignment,Crane scheduling | Mathematical optimization,Scheduling (computing),Operations research,Cutting plane algorithm,Schedule,Integer programming,Linear programming,Crane scheduling,Time complexity,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
254 | 3 | 0377-2217 |
Citations | PageRank | References |
9 | 0.48 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yavuz Bogaç Türkogullari | 1 | 45 | 2.73 |
| Z. Caner TaşKıN | 2 | 82 | 12.14 |
| Necati Aras | 3 | 462 | 30.62 |
| I. Kuban Altinel | 4 | 150 | 14.60 |