{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T02:09:53Z","timestamp":1778724593539,"version":"3.51.4"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100016369","name":"Aurubis AG","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100016369","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers &amp; Chemical Engineering"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.compchemeng.2026.109654","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:20:50Z","timestamp":1775578850000},"page":"109654","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Optimal crane scheduling for tankhouse copper processing"],"prefix":"10.1016","volume":"211","author":[{"given":"Yuming","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophia","family":"Onyshkevych","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Galanopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonardo Salsano","family":"de Assis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bianca","family":"Springub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Wassick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7210-084X","authenticated-orcid":false,"given":"Ignacio E.","family":"Grossmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.compchemeng.2026.109654_bib0001","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ejor.2017.05.040","article-title":"MIP approaches for the integrated Berth allocation and Quay crane assignment and scheduling problem","volume":"264","author":"Agra","year":"2018","journal-title":"Eur. J. Oper. Res."},{"issue":"August","key":"10.1016\/j.compchemeng.2026.109654_bib0002","article-title":"Centralized and hierarchical scheduling frameworks for copper smelting process","volume":"164","author":"Ahmed","year":"2022","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.compchemeng.2026.109654_bib0003","series-title":"Operations Research, Computing and Homeland Defense (ICS 2011 Proceedings)","first-page":"93","article-title":"Factory crane scheduling by dynamic programming","author":"Aron","year":"2010"},{"issue":"4","key":"10.1016\/j.compchemeng.2026.109654_bib0004","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10951-009-0105-0","article-title":"A fast heuristic for Quay Crane scheduling with interference constraints","volume":"12","author":"Bierwirth","year":"2009","journal-title":"J. Sched."},{"key":"10.1016\/j.compchemeng.2026.109654_bib0005","series-title":"Introduction to Stochastic Programming, By John R. Birge and Fran\u00e7ois Louveaux. Springer Series in Operations Research and Financial Engineering","article-title":"Stochastic integer programs","author":"Birge","year":"2011"},{"issue":"3","key":"10.1016\/j.compchemeng.2026.109654_bib0006","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0191-2615(89)90001-5","article-title":"The crane scheduling problem","volume":"23","author":"Daganzo","year":"1989","journal-title":"Transp. Res. B: Methodol."},{"key":"10.1016\/j.compchemeng.2026.109654_bib0007","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1002\/nav.21768","article-title":"Optimally scheduling interfering and non-interfering cranes","volume":"64","author":"Emde","year":"2017","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"November","key":"10.1016\/j.compchemeng.2026.109654_bib0008","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.compchemeng.2018.08.024","article-title":"An optimization framework for scheduling of converter aisle operation in a nickel smelting plant","volume":"119","author":"Ewaschuk","year":"2018","journal-title":"Comput. Chem. Eng."},{"issue":"March","key":"10.1016\/j.compchemeng.2026.109654_bib0010","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.compchemeng.2013.12.001","article-title":"Scope for industrial applications of production scheduling models and solution methods","volume":"62","author":"Harjunkoski","year":"2014","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"10.1016\/j.compchemeng.2026.109654_bib0011","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/ijoc.14.4.295.2828","article-title":"Logic, optimization, and constraint programming","volume":"14","author":"Hooker","year":"2002","journal-title":"INFORMS. J. Comput."},{"key":"10.1016\/j.compchemeng.2026.109654_bib0009","doi-asserted-by":"crossref","first-page":"64650","DOI":"10.1109\/ACCESS.2022.3180752","article-title":"Heuristic\/metaheuristic-based simulation optimization approaches for integrated scheduling of yard crane, yard truck, and quay crane considering import and export containers","volume":"10","author":"Hsu","year":"2022","journal-title":"IEEe Access"},{"issue":"1","key":"10.1016\/j.compchemeng.2026.109654_bib0012","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10696-020-09385-5","article-title":"A comprehensive review of Quay crane scheduling, yard operations and integrations thereof in container terminals","volume":"33","author":"Kizilay","year":"2021","journal-title":"Flex. Serv. Manuf. J."},{"issue":"1","key":"10.1016\/j.compchemeng.2026.109654_bib0014","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.ejor.2008.08.019","article-title":"Discrete time model and algorithms for container yard crane scheduling","volume":"198","author":"Li","year":"2009","journal-title":"Eur J Oper Res"},{"key":"10.1016\/j.compchemeng.2026.109654_bib0013","series-title":"A Continuous-Time Model For Multiple Yard Crane Scheduling With Last-Minute Job Arrivals","author":"Li","year":"2015"},{"issue":"October","key":"10.1016\/j.compchemeng.2026.109654_bib0016","article-title":"MILP modeling and optimization of multi-objective flexible job shop scheduling problem with controllable processing times","volume":"82","author":"Meng","year":"2023","journal-title":"Swarm. Evol. Comput."},{"issue":"February","key":"10.1016\/j.compchemeng.2026.109654_bib0017","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/nav.20121","article-title":"A branch-and-cut algorithm for the quay crane scheduling problem in A container terminal","volume":"53","author":"Moccia","year":"2006","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"9","key":"10.1016\/j.compchemeng.2026.109654_bib0018","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1016\/S0098-1354(99)00285-9","article-title":"Scheduling of the batch annealing process \u2014 Deterministic case","volume":"23","author":"Moon","year":"1999","journal-title":"Comput. Chem. Eng."},{"issue":"May","key":"10.1016\/j.compchemeng.2026.109654_bib0019","article-title":"A comprehensive review and directions for future research on the integrated scheduling of quay cranes and automated guided vehicles and yard cranes in automated container terminals","volume":"179","author":"Naeem","year":"2023","journal-title":"Comput. Ind. Eng."},{"issue":"November","key":"10.1016\/j.compchemeng.2026.109654_bib0020","article-title":"Integrated optimization of storage location assignment and crane scheduling in an unmanned slab yard","volume":"161","author":"Peng","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.compchemeng.2026.109654_bib33","series-title":"CP-SAT (v9.12). Google","author":"Perron","year":"2025"},{"issue":"3","key":"10.1016\/j.compchemeng.2026.109654_bib0021","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s13675-014-0026-3","article-title":"A constraint programming primer","volume":"2","author":"Pesant","year":"2014","journal-title":"EURO J. Comput. Optim."},{"issue":"August","key":"10.1016\/j.compchemeng.2026.109654_bib0022","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.cor.2014.03.005","article-title":"Scheduling multiple factory cranes on a common track","volume":"48","author":"Peterson","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.compchemeng.2026.109654_bib0023","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1016\/j.ejor.2020.02.021","article-title":"Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel","volume":"285","author":"Qin","year":"2020","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"10.1016\/j.compchemeng.2026.109654_bib0024","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","article-title":"Modelling and computational techniques for logic based integer programming","volume":"18","author":"Raman","year":"1994","journal-title":"Comput. Chem. Eng."},{"issue":"February","key":"10.1016\/j.compchemeng.2026.109654_bib0015","article-title":"Discrete-time and continuous-time scheduling approaches for crane-assisted pipeless process plants","volume":"170","author":"Madenoor Ramapriya","year":"2023","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.compchemeng.2026.109654_bib0025","article-title":"Chapter 4 constraint programming","volume":"3","author":"Rossi","year":"2008"},{"key":"10.1016\/j.compchemeng.2026.109654_bib0026","series-title":"Crane\u2019s Information System in Operations Management","author":"Siitari","year":"2022"},{"issue":"April","key":"10.1016\/j.compchemeng.2026.109654_bib0027","article-title":"Quay crane scheduling in automated container terminal for the trade-off between operation efficiency and energy consumption","volume":"48","author":"Tan","year":"2021","journal-title":"Adv. Eng. Inform."},{"issue":"3","key":"10.1016\/j.compchemeng.2026.109654_bib0028","first-page":"188","article-title":"A heuristic scheduling algorithm for steel making process with crane handling (< Special Issue>advanced planning and scheduling for supply chain management)","volume":"49","author":"Tanizaki","year":"2006","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"November","key":"10.1016\/j.compchemeng.2026.109654_bib0029","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.tre.2013.08.006","article-title":"Constraint programming approach to Quay Crane scheduling problem","volume":"59","author":"Unsal","year":"2013","journal-title":"Transp. Res. E: Logist. Transp. Rev."},{"issue":"January","key":"10.1016\/j.compchemeng.2026.109654_bib0031","article-title":"Solving the yard crane scheduling problem with dynamic assignment of input\/output points","volume":"173","author":"Wang","year":"2025","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.compchemeng.2026.109654_bib32","doi-asserted-by":"crossref","DOI":"10.3390\/pr11020549","article-title":"Solving the two-crane scheduling problem in the pre-steelmaking process","volume":"11","author":"Xie","year":"2023","journal-title":"Processes"}],"container-title":["Computers &amp; Chemical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0098135426001079?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0098135426001079?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T01:39:48Z","timestamp":1778722788000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0098135426001079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":32,"alternative-id":["S0098135426001079"],"URL":"https:\/\/doi.org\/10.1016\/j.compchemeng.2026.109654","relation":{},"ISSN":["0098-1354"],"issn-type":[{"value":"0098-1354","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal crane scheduling for tankhouse copper processing","name":"articletitle","label":"Article Title"},{"value":"Computers & Chemical Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.compchemeng.2026.109654","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"109654"}}