{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:18:12Z","timestamp":1753881492850,"version":"3.41.2"},"reference-count":31,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/100022955","name":"Fundamental Research Funds for the Provincial Universities of Zhejiang","doi-asserted-by":"crossref","award":["GK229909299001-407"],"award-info":[{"award-number":["GK229909299001-407"]}],"id":[{"id":"10.13039\/100022955","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Zhejiang Provincial NSF","award":["LY21A010014"],"award-info":[{"award-number":["LY21A010014"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11971139","11771114"],"award-info":[{"award-number":["11971139","11771114"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:p> In this paper, we consider the gantry crane scheduling problem at a single storage block where a total of [Formula: see text] gantry cranes are mounted on double tracks so that cranes on different tracks can pass each other while those on the same track cannot. Containers at the storage block are divided into bays and each bay of containers has to be loaded\/unloaded together due to the same shipping destination or the same customer. To minimize the overall loading\/ unloading time of containers, we first formulate the problem to a mixed integer linear programming (MILP) model, and compute the optimal solutions of small instances by the Gurobi solver. Then we design several heuristic algorithms and test their efficiency and performance by a series of large instances. In particular, we present a polynomial time approximation algorithm for the case where all but one gantry crane is mounted on the same track. We show that the algorithm has a worst case ratio of [Formula: see text], outperforming the partition-based algorithms in the single-track scenario. <\/jats:p>","DOI":"10.1142\/s0217595923400213","type":"journal-article","created":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T03:48:52Z","timestamp":1687146532000},"source":"Crossref","is-referenced-by-count":0,"title":["Scheduling double-track gantry cranes to minimize the overall loading\/ unloading time"],"prefix":"10.1142","volume":"40","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[{"name":"School of Electronics and Information Engineering, Taizhou University, Linhai 317000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangting","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University of Water Resources and Electric Power, Zhejiang, Hangzhou 310018, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinle","family":"Xuan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuehuan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Statistics and Mathematics, Zhejiang Gongshang University, Hangzhou 310018, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hecheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,7,27]]},"reference":[{"issue":"4","key":"S0217595923400213BIB001","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10951-009-0105-0","volume":"12","author":"Bierwirth C","year":"2009","journal-title":"Journal of Scheduling"},{"issue":"3","key":"S0217595923400213BIB002","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"Bierwirth C","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"S0217595923400213BIB003","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.ejor.2014.12.030","volume":"244","author":"Bierwirth C","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"S0217595923400213BIB004","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.ejor.2016.08.041","volume":"258","author":"Boysen N","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"S0217595923400213BIB005","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.dam.2015.07.042","volume":"201","author":"Briskorn D","year":"2016","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"S0217595923400213BIB007","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ejor.2013.10.054","volume":"235","author":"Carlo Hctor J","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"16","key":"S0217595923400213BIB008","doi-asserted-by":"crossref","first-page":"4820","DOI":"10.1080\/00207543.2013.774489","volume":"51","author":"Chung S","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"3","key":"S0217595923400213BIB009","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s00291-010-0206-3","volume":"32","author":"Dorndorf U","year":"2010","journal-title":"Or Spectrum"},{"issue":"10","key":"S0217595923400213BIB010","doi-asserted-by":"crossref","first-page":"4063","DOI":"10.1016\/j.asoc.2013.05.006","volume":"13","author":"Expsito-Izquierdo C","year":"2013","journal-title":"Applied Soft Computing"},{"issue":"2","key":"S0217595923400213BIB011","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1057\/mel.2015.3","volume":"18","author":"Gharehgozli AH","year":"2016","journal-title":"Maritime Economics & Logistics"},{"key":"S0217595923400213BIB012","doi-asserted-by":"crossref","DOI":"10.1002\/9780470400531.eorms0190","volume-title":"Decision Problems and Applications of Operations Research at Marine Container Terminals","author":"Goodchild A","year":"2011"},{"key":"S0217595923400213BIB014","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2017.06.015","volume":"242","author":"Jaehn F","year":"2018","journal-title":"Discrete Applied Mathematics"},{"key":"S0217595923400213BIB015","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s00291-011-0242-7","volume":"34","author":"Kemme N","year":"2012","journal-title":"OR Spectrum"},{"issue":"3","key":"S0217595923400213BIB016","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1016\/S0377-2217(03)00133-4","volume":"156","author":"Kim KH","year":"2004","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"S0217595923400213BIB017","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ejor.2018.07.043","volume":"273","author":"Kress D","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"S0217595923400213BIB018","series-title":"TRISTAN VI","volume-title":"Proceedings of the sixth triennial symposium on transportation analysis","author":"Lee DH","year":"2007"},{"issue":"1","key":"S0217595923400213BIB019","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/03052150902943020","volume":"42","author":"Lee DH","year":"2010","journal-title":"Engineering Optimization"},{"issue":"2","key":"S0217595923400213BIB020","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10288-013-0235-2","volume":"12","author":"Legato P","year":"2014","journal-title":"4OR"},{"issue":"2","key":"S0217595923400213BIB021","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.ejor.2014.03.011","volume":"239","author":"Lehnfeld J","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"S0217595923400213BIB022","series-title":"LNCS:3111","first-page":"323","volume-title":"Proceedings of the ninth Scandinavian workshop on algorithm theory","author":"Lim A","year":"2004"},{"key":"S0217595923400213BIB023","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/nav.20189","volume":"54","author":"Lim A","year":"2007","journal-title":"Naval Research Logistics"},{"issue":"2","key":"S0217595923400213BIB024","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s11590-014-0756-4","volume":"9","author":"Liu M","year":"2015","journal-title":"Optimization Letters"},{"issue":"2","key":"S0217595923400213BIB025","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/trsc.1120.0419","volume":"47","author":"Meisel F","year":"2013","journal-title":"Transportation Science"},{"issue":"4","key":"S0217595923400213BIB026","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1504\/IJSTL.2011.041137","volume":"3","author":"Monaco MF","year":"2011","journal-title":"International Journal of Shipping and Transport Logistics"},{"issue":"4","key":"S0217595923400213BIB027","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10951-007-0029-5","volume":"10","author":"Sammarra M","year":"2007","journal-title":"Journal of Scheduling"},{"volume-title":"Proceedings of International Conference on Computational Logistics","year":"2011","author":"Speer U","key":"S0217595923400213BIB028"},{"key":"S0217595923400213BIB030","first-page":"1","volume-title":"Proceedings of the Swiss Transport Research Conference (STRC)","author":"Vacca I","year":"2007"},{"issue":"1","key":"S0217595923400213BIB031","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00293-X","volume":"147","author":"Vis I","year":"2003","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"S0217595923400213BIB032","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1287\/trsc.1090.0298","volume":"44","author":"Vis Iris FA","year":"2010","journal-title":"Transportation Science"},{"issue":"3","key":"S0217595923400213BIB033","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1016\/j.ejor.2016.10.021","volume":"258","author":"Zhang A","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"S0217595923400213BIB034","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1057\/palgrave.jors.2602110","volume":"57","author":"Zhu Y","year":"2006","journal-title":"Journal of the Operation Research Society"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595923400213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T07:59:21Z","timestamp":1696406361000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0217595923400213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,27]]},"references-count":31,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10.1142\/S0217595923400213"],"URL":"https:\/\/doi.org\/10.1142\/s0217595923400213","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"type":"print","value":"0217-5959"},{"type":"electronic","value":"1793-7019"}],"subject":[],"published":{"date-parts":[[2023,7,27]]},"article-number":"2340021"}}