{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:48:38Z","timestamp":1765961318264,"version":"build-2065373602"},"reference-count":32,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T00:00:00Z","timestamp":1615507200000},"content-version":"vor","delay-in-days":70,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2020,11,22]]},"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1051\/ro\/2020135","type":"journal-article","created":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:25:23Z","timestamp":1606166723000},"page":"115-133","source":"Crossref","is-referenced-by-count":6,"title":["Solving methods for the quay crane scheduling problem at port of Tripoli-Lebanon"],"prefix":"10.1051","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1568-8381","authenticated-orcid":false,"given":"Ali","family":"Skaf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sid","family":"Lamrous","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zakaria","family":"Hammoudan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Ange","family":"Manier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,3,12]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.jmsy.2015.02.010","volume":"36","author":"Al-Dhaheri","year":"2015","journal-title":"J. Manuf. Syst."},{"key":"R2","unstructured":"Alnaqbi B., Alrubaiai H. and Alawi S.A., Combination of a dynamic-hybrid berth allocation problem with a quay crane scheduling problem. In: 2016 7th International Conference on Information, Intelligence, Systems & Applications (IISA) (2016)."},{"key":"R3","unstructured":"Awar K.A., Alawani M. and Jaberi S.A., A multi-vessel quay crane scheduling problem. In: 2016 7th International Conference on Information, Intelligence, Systems & Applications (IISA) (2016)."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Azza L., Merouani M.E. and Medouri A., Ant colony system for solving quay crane scheduling problem in container terminal. In: 2014 International Conference on Logistics Operations Management (2014).","DOI":"10.1109\/GOL.2014.6887437"},{"key":"R5","unstructured":"Bellman R., Dynamic Programming. Princeton University Press (1957)."},{"key":"R6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.ejor.2016.08.041","volume":"258","author":"Boysen","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"4213","DOI":"10.1016\/j.eswa.2011.09.113","volume":"39","author":"Chung","year":"2012","journal-title":"Expert Syst. App."},{"key":"R8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","volume":"23","author":"Daganzo","year":"1989","journal-title":"Transp. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2013.12.012","volume":"73","author":"Diabat","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"R10","unstructured":"Goldberg D., Genetic algorithms in search. Addison-Wesley Professional, Reading, MA (1989)."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Haoyuan L. and Qi S., Simulation-based optimization on quay crane scheduling of container terminals. In: 2017 29th Chinese Control And Decision Conference (CCDC) (2017).","DOI":"10.1109\/CCDC.2017.7978689"},{"key":"R12","unstructured":"Holland J., Genetic algorithms, computer programs that evolve in ways that resemble natural selection can solve complex problems even their creators do not fully understand. http:\/\/www2.econ.iastate.edu\/tesfatsi\/holland.GAIntro.htm (1960)."},{"key":"R13","first-page":"366","volume":"4","author":"Kantorovich","year":"1939","journal-title":"Manage. Sci."},{"key":"R14","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"Kim","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1016\/j.cie.2008.09.024","volume":"56","author":"Liang","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"R16","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1002\/nav.10123","volume":"51","author":"Lim","year":"2004","journal-title":"Nav. Res. Logistics"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Liu M., Wang S. and Chu C., A branch-and-price framework for the general double-cycling problem with internal-reshuffles. In: 2015 IEEE 12th International Conference on Networking, Sensing and Control (2015).","DOI":"10.1109\/ICNSC.2015.7116053"},{"key":"R18","doi-asserted-by":"crossref","first-page":"1650018","DOI":"10.1142\/S179383091650018X","volume":"8","author":"Liu","year":"2016","journal-title":"Discrete Math. Algorithms App."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Msakni M.K., Diabat A., Rabadi G. and Kotachi M., An integrated quay crane assignment and scheduling problem using branch-and-price. In: International Conference on Computational Science and Computational Intelligence (2016).","DOI":"10.1109\/CSCI.2016.0241"},{"key":"R20","unstructured":"Oliveira J.P.R.D., Barbosa J.D. and Lamprou M., Multi-objective optimization of the quay crane assignment and scheduling problem: time and movement optimization. In: 2016 7th International Conference on Information, Intelligence, Systems and Applications (IISA) (2016)."},{"key":"R21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(90)90014-P","volume":"24","author":"Peterkofsky","year":"1990","journal-title":"Transp. Res."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Salhi A., Alsoufi G. and Yang X., An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports. Adv. Theor. Appl. Comb. Optim. (2017).","DOI":"10.1007\/s10479-017-2539-7"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"Skaf A., Lamrous S., Hammoudan Z. and Manier M.-A., Exact method for single vessel and multiple quay cranes to solve scheduling problem at port of tripoli-lebanon. In: 2018 International Conference on Industrial Engineering and Engineering Management (2018).","DOI":"10.1109\/IEEM.2018.8607546"},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Skaf A., Lamrous S., Hammoudan Z. and Manier M.-A., Genetic algorithm to optimize unloading of large containers vessel in port of tripoli-lebanon. Decision and Information Technologies (2019).","DOI":"10.1109\/CoDIT.2019.8820367"},{"key":"R25","unstructured":"Skaf A., Lamrous S., Hammoudan Z. and Manier M.-A., Single quay crane and multiple yard trucks scheduling problem with integration of reach-stacker cranes at port of tripoli-lebanon. In: 2019 IEEE International Conference on Systems, Man, and Cybernetics (2019)."},{"key":"R26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","volume":"26","author":"Steeken","year":"2004","journal-title":"OR Spectr."},{"key":"R27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.cie.2008.05.011","volume":"56","author":"Tavakkoli-Moghaddam","year":"2009","journal-title":"Comput. Ind. Eng."},{"key":"R28","doi-asserted-by":"crossref","unstructured":"Wang S. and Hu W., Multi quay crane scheduling problem based on aco in container terminals. In: 2009 International Conference on Management and Service Science (2009).","DOI":"10.1109\/ICMSS.2009.5301977"},{"key":"R29","unstructured":"Wang S. and Hu W., An investigation into berth and quay crane scheduling for container terminals based on knowledge. In: International Conference on Future Information Technology and Management Engineering (2010)."},{"key":"R30","unstructured":"Xiazhong C., Ye Z. and Hongtao H., Optimization research of joint quay crane scheduling and block selection in container terminals. In: 2017 International Conference on Service Systems and Service Management (2017)."},{"key":"R31","unstructured":"Yi D., GuoLong L. and ChengJi L., Model and heuristic algorithm for quay crane scheduling at container terminal. In: 9th International Conference on Fuzzy Systems and Knowledge Discovery (2012)."},{"key":"R32","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10479-016-2335-9","volume":"273","author":"Zhen","year":"2016","journal-title":"Ann. Oper. Res."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020135\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T09:21:37Z","timestamp":1615540897000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":32,"journal-issue":{"issue":"1"},"alternative-id":["ro190395"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2020135","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"1290-3868"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}