Volume 4, Issue 3, November 2013, Pages 547–551
Azza Lajjam1, Mohamed El Merouani2, Abdellatif Medouri3, and Yassine Tabaa4
1 SIT Laboratory, Faculty of Sciences, Abelmalek Essaadi University, Tetouan, Morocco
2 SIT Laboratory, Faculty of Sciences, Abelmalek Essaadi University, Tetouan, Morocco
3 SIT Laboratory, Faculty of Sciences, Abelmalek Essaadi University, Tetouan, Morocco
4 SIT Laboratory, Faculty of Sciences, Abelmalek Essaadi University, Tetouan, Morocco
Original language: English
Copyright © 2013 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
In the last decades, competition between port container terminals, especially between geographically close one, is rapidly increasing. To improve this competitiveness, terminal managers try to achieve rapid container vessel loading and unloading, that corresponds to a reduction of the time in port for vessels. In this paper, we focus our attention on the operational decision problem related to the seaside area of maritime container terminals. In particular, we study The Quay Crane Scheduling Problem (QCSP) which is considered as a core task of managing maritime container terminals and the optimization of these operations affects significantly the time spent by vessels at berth. The main goal behind this planning problem is to find the optimized sequence of loading and unloading tasks on a set of deployed quay cranes in order to exploit the full performances of port's resources while reducing the berth's total time occupation by vessels. In this paper, we provide a rich model for quay crane scheduling problem that covers important parameters such as ready time and due dates of Quay cranes (QCs), safety margin in order to avoid congestion between QCs and precedence relations among tasks. The proposed model seeks for a more compact mathematical formulation that can be easily solved by a standard optimization solver. Thus, we formulated the Quay Crane Scheduling Problem as a mixed-integer linear model that minimizes the sum of the QCs holding cost and tardiness penalty cost.
Author Keywords: Transportation, Quay crane, Scheduling, Container terminal, Mixed-integer programming.
Azza Lajjam1, Mohamed El Merouani2, Abdellatif Medouri3, and Yassine Tabaa4
1 SIT Laboratory, Faculty of Sciences, Abelmalek Essaadi University, Tetouan, Morocco
2 SIT Laboratory, Faculty of Sciences, Abelmalek Essaadi University, Tetouan, Morocco
3 SIT Laboratory, Faculty of Sciences, Abelmalek Essaadi University, Tetouan, Morocco
4 SIT Laboratory, Faculty of Sciences, Abelmalek Essaadi University, Tetouan, Morocco
Original language: English
Copyright © 2013 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
In the last decades, competition between port container terminals, especially between geographically close one, is rapidly increasing. To improve this competitiveness, terminal managers try to achieve rapid container vessel loading and unloading, that corresponds to a reduction of the time in port for vessels. In this paper, we focus our attention on the operational decision problem related to the seaside area of maritime container terminals. In particular, we study The Quay Crane Scheduling Problem (QCSP) which is considered as a core task of managing maritime container terminals and the optimization of these operations affects significantly the time spent by vessels at berth. The main goal behind this planning problem is to find the optimized sequence of loading and unloading tasks on a set of deployed quay cranes in order to exploit the full performances of port's resources while reducing the berth's total time occupation by vessels. In this paper, we provide a rich model for quay crane scheduling problem that covers important parameters such as ready time and due dates of Quay cranes (QCs), safety margin in order to avoid congestion between QCs and precedence relations among tasks. The proposed model seeks for a more compact mathematical formulation that can be easily solved by a standard optimization solver. Thus, we formulated the Quay Crane Scheduling Problem as a mixed-integer linear model that minimizes the sum of the QCs holding cost and tardiness penalty cost.
Author Keywords: Transportation, Quay crane, Scheduling, Container terminal, Mixed-integer programming.
How to Cite this Article
Azza Lajjam, Mohamed El Merouani, Abdellatif Medouri, and Yassine Tabaa, “Mathematical model for Quay Crane Scheduling Problem with spatial constraints,” International Journal of Innovation and Applied Studies, vol. 4, no. 3, pp. 547–551, November 2013.
