{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:38:41Z","timestamp":1648996721868},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> At a container port, container vessels are served by quay cranes for loading and unloading containers. Each vessel is typically split into bays from head to tail where containers are stored. Parallel quay cranes can process different bays simultaneously, and their processing efficiency significantly affects the turn-around time of a container vessel. Sharing a single traveling rail, the quay cranes cannot crossover each other, and this phenomenon is referred as the non-crossing constraint. In addition, the quay cranes may have different processing speeds due to gradual equipment updates. Inspired by updating activities of cranes in modern container terminals, this paper studies a scheduling problem with two uniform quay cranes, aiming at minimizing the turn-around time of a vessel, i.e., the makespan. We mainly develop an integrated approximation algorithm which is [Formula: see text]-approximation, where the two quay cranes are of processing speeds 1 and [Formula: see text], respectively. <\/jats:p>","DOI":"10.1142\/s179383091650018x","type":"journal-article","created":{"date-parts":[[2016,1,14]],"date-time":"2016-01-14T11:25:10Z","timestamp":1452770710000},"page":"1650018","source":"Crossref","is-referenced-by-count":3,"title":["Approximation algorithm for uniform quay crane scheduling at container ports"],"prefix":"10.1142","volume":"08","author":[{"given":"Ming","family":"Liu","sequence":"first","affiliation":[{"name":"School of Economics and Management, Tongji University, Shanghai 200092, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[{"name":"Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[{"name":"Business School, Sichuan University, Chengdu 610065, P. R. China"},{"name":"State Key Lab for Manufacturing Systems Engineering, Xi\u2019an 710049, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Tongji University, Shanghai 200092, P. R. China"},{"name":"Laboratoire G\u00e9nie Industriel, Centrale Sup\u00e9lec, Universit\u00e9 Paris-Saclay, Grande Voie des Vignes, 92290 Ch\u00e2tenay-Malabry, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,5,26]]},"reference":[{"key":"S179383091650018XBIB002","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20189"},{"key":"S179383091650018XBIB003","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1060.0148"},{"key":"S179383091650018XBIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2007.02.006"},{"key":"S179383091650018XBIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-009-0105-0"},{"key":"S179383091650018XBIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.05.031"},{"key":"S179383091650018XBIB007","first-page":"1","volume":"1251","author":"Daganzo C. F.","year":"1989","journal-title":"Transp. Res. Rec."},{"key":"S179383091650018XBIB008","author":"Lee C. Y.","year":"2014","journal-title":"Transp. Sci."},{"key":"S179383091650018XBIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-003-0157-z"},{"key":"S179383091650018XBIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2006.08.001"},{"key":"S179383091650018XBIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-013-9178-3"},{"key":"S179383091650018XBIB012","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00133-4"},{"key":"S179383091650018XBIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2015.06.009"},{"key":"S179383091650018XBIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-014-0756-4"},{"key":"S179383091650018XBIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-007-0100-9"},{"key":"S179383091650018XBIB017","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0765-3"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091650018X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:04:15Z","timestamp":1565125455000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091650018X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,26]]},"references-count":15,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2016,5,26]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S179383091650018X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091650018x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,26]]}}}