A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals
Amelie Eilken ()
Additional contact information
Amelie Eilken: University of Hamburg
Journal of Scheduling, 2019, vol. 22, issue 5, No 2, 517-541
Abstract:
Abstract In today’s ports, the storage area is often the bottleneck in the serving of a vessel. It is therefore an important influencing factor in the minimization of the turnaround time of the vessels, which is the main objective in operational planning in container terminals. The operational planning of the yard cranes strongly impacts the yard’s efficiency. This planning task comprises the assignment of jobs to cranes, the sequencing of jobs per crane and the scheduling of crane movement and job executions subject to time windows and precedence constraints. A common yard configuration is a block storage system with two identical automated gantry cranes, called twin cranes. These cranes are subject to non-crossing constraints and therefore often exclusively serve either the landside or the seaside of the terminal. A polynomial-time algorithm for the scheduling subproblem of the cranes is introduced. As the sequencing and assignment part of this planning task is NP-hard, the overall problem is solved heuristically with a branch and bound procedure that includes the introduced scheduling algorithm as an evaluation subroutine. A computational study is presented to test the performance of this approach against a mathematical program solved by CPLEX.
Keywords: OR in maritime industry; Container terminal; Real-time scheduling; Crane scheduling; Non-crossing constraints (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10951-019-00611-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:22:y:2019:i:5:d:10.1007_s10951-019-00611-z
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951
DOI: 10.1007/s10951-019-00611-z
Access Statistics for this article
Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo
More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().