Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level

2018 ◽  
Vol 99 ◽  
pp. 218-233 ◽  
Author(s):  
Mohamed Kais Msakni ◽  
Ali Diabat ◽  
Ghaith Rabadi ◽  
Mohamed Al-Salem ◽  
Mariam Kotachi
Author(s):  
Ali Skaf ◽  
Sid Lamrous ◽  
Zakaria Hammoudan ◽  
Marie-Ange Manier

The quay crane scheduling problem (QCSP) is a global problem and all ports around the world seek to solve it, to get an acceptable time of unloading containers from the vessels or loading containers to the vessels and therefore reducing the docking time in the terminal. This paper proposes three solutions for the QCSP in port of Tripoli-Lebanon, two exact methods which are the mixed integer linear programming and the dynamic programming algorithm, to obtain the optimal solution and one heuristic method which is the genetic algorithm, to obtain near optimal solution within an acceptable CPU time. The main objective of these methods is to minimize the unloading or the loading time of the containers and therefore reduce the waiting time of the vessels in the terminals. We tested and validated our methods for small and large random instances. Finally, we compared the results obtained with these methods for some real instances in the port of Tripoli-Lebanon.


2018 ◽  
Vol 15 (3) ◽  
pp. 1399-1412 ◽  
Author(s):  
Zizhen Zhang ◽  
Ming Liu ◽  
Chung-Yee Lee ◽  
Jiahai Wang

2012 ◽  
Vol 39 (12) ◽  
pp. 2915-2928 ◽  
Author(s):  
Zhiqiang Lu ◽  
Xiaole Han ◽  
Lifeng Xi ◽  
Alan L. Erera

2007 ◽  
Vol 10 (4-5) ◽  
pp. 327-336 ◽  
Author(s):  
Marcello Sammarra ◽  
Jean-François Cordeau ◽  
Gilbert Laporte ◽  
M. Flavia Monaco

2015 ◽  
Vol 36 ◽  
pp. 87-94 ◽  
Author(s):  
Noura Al-Dhaheri ◽  
Ali Diabat

2012 ◽  
Vol 39 (18) ◽  
pp. 13108-13117 ◽  
Author(s):  
Narges Kaveshgar ◽  
Nathan Huynh ◽  
Saeed Khaleghi Rahimian

Sign in / Sign up

Export Citation Format

Share Document