Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 273, Issue 2, Pages 504-515Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2018.08.009
Keywords
OR In Maritime Industry; Container Terminal; Quay Crane Scheduling; Logic-Based Benders Decomposition
Funding
- National Key Research and Development Program of China [2016YFB0901900]
- Fund for Innovation Research Groups of the National Natural Science Foundation of China [71621061]
- Major International Joint Re search Project of the National Natural Science Foundation of China [71520107004]
- Major Program of National Natural Science Foundation of China [71790614]
- 111 Project [B16009]
Ask authors/readers for more resources
In this paper, we study the Quay Crane Scheduling Problem (QCSP) in container terminals. We describe a new mathematical formulation for the QCSP and by addressing the structure of workload assignments we develop an easier way to handle non-crossing constraints. The proposed mathematical formulation is used in an exact solution framework based on logic-based Benders decomposition. The proposed approach decomposes the problem into a workload-assignment master problem and operation-sequence slave subproblems. Logic-based cuts are proposed to ensure the convergence of the approach. Computational results show the effectiveness of the proposed solution approach. (C) 2018 Published by Elsevier B.V.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available