This chapter deals with the QCSP on the basis of container groups. It is studied as an isolated problem here and functionally integrated into the BACAP in the next chapter. Crane scheduling for container groups has been introduced by Kim and Park (2004). As noted by Moccia et al. (2006), the original QCSP model provided by Kim and Park shows an inaccuracy regarding the detection of crane interference. Unfortunately, even reworked problem formulations still tolerate certain cases of crane interference. A corrected problem formulation and a heuristic solution method have been provided by Bierwirth and Meisel (2006). The model and the heuristic are presented in Section 7.1 and Section 7.2, respectively. In Section 7.3 the QCSP is extended by incorporation of time windows for the cranes. Necessary modifications of the mathematical formulation and the solution method are described. Computational tests follow in Section 7.4. The study on the QCSP is concluded in Section 7.5.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Physica-Verlag Heidelberg
About this chapter
Cite this chapter
Meisel, F. (2009). Quay Crane Scheduling. In: Seaside Operations Planning in Container Terminals. Contributions to Management Science. Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-2191-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-7908-2191-8_7
Published:
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-2190-1
Online ISBN: 978-3-7908-2191-8
eBook Packages: Business and EconomicsBusiness and Management (R0)