{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T00:33:36Z","timestamp":1790037216091,"version":"4.0.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T00:00:00Z","timestamp":1531699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10951-018-0578-9","type":"journal-article","created":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T08:49:53Z","timestamp":1531730993000},"page":"173-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4989-7587","authenticated-orcid":false,"given":"Alessandro","family":"Hill","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7286-9501","authenticated-orcid":false,"given":"Eduardo","family":"Lalla-Ruiz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1904-7215","authenticated-orcid":false,"given":"Marcos","family":"Goycoolea","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,16]]},"reference":[{"issue":"2","key":"578_CR1","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.ejor.2016.12.039","volume":"260","author":"Z Amirgaliyeva","year":"2017","unstructured":"Amirgaliyeva, Z., Mladenovi\u0107, N., Todosijevi\u0107, R., & Uro\u0161evi\u0107, D. (2017). Solving the maximum min-sum dispersion by alternating formulations of two different problems. European Journal of Operational Research, 260(2), 444\u2013459.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"578_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02283745","volume":"16","author":"M Bartusch","year":"1988","unstructured":"Bartusch, M., M\u00f6hring, R. H., & Radermacher, F. J. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16(1), 199\u2013240.","journal-title":"Annals of Operations Research"},{"key":"578_CR3","unstructured":"Beck, J. C., Prosser, P., & Selensky, E. (2002). On the reformulation of vehicle routing problems and scheduling problems. In International symposium on abstraction, reformulation, and approximation (pp. 282\u2013289). Berlin: Springer."},{"issue":"4","key":"578_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","volume":"47","author":"K Buhrkal","year":"2011","unstructured":"Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., & Lusby, R. (2011). Models for the discrete berth allocation problem: A computational comparison. Transportation Research Part E: Logistics and Transportation Review, 47(4), 461\u2013473.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"578_CR5","doi-asserted-by":"crossref","unstructured":"Campbell, J. F., Smith, L. D., Sweeney, D. C. I., Mundy, R., & Nauss, R. M. (2007). Decision tools for reducing congestion at locks on the upper Mississippi river. In 40th Hawaii international conference on system sciences, HICSS (pp. 56\u201356). IEEE.","DOI":"10.1109\/HICSS.2007.164"},{"key":"578_CR6","unstructured":"Dassault Systems, D. (2017). Quintic website. Accessed Feburary 02, 2018, from http:\/\/www.quintiq.com\/news-2017\/panama-canal-to-launch-state-of-the-art-vessel-scheduling-and-maritime-resources-management-system.html ."},{"key":"578_CR7","unstructured":"Disser, Y., Klimm, M., & L\u00fcbbecke, E. (2015). Scheduling bidirectional traffic on a path. In International colloquium on automata, languages, and programming (pp. 406\u2013418). Berlin: Springer."},{"issue":"4","key":"578_CR8","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1287\/trsc.2014.0568","volume":"49","author":"Y Du","year":"2015","unstructured":"Du, Y., Chen, Q., Lam, J. S. L., Xu, Y., & Cao, J. X. (2015). Modeling the impacts of tides and the virtual arrival policy in berth allocation. Transportation Science, 49(4), 939\u2013956.","journal-title":"Transportation Science"},{"issue":"5","key":"578_CR9","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10951-017-0510-8","volume":"20","author":"AT Ernst","year":"2017","unstructured":"Ernst, A. T., O\u011fuz, C., Singh, G., & Taherkhani, G. (2017). Mathematical models for the berth allocation problem in dry bulk terminals. Journal of Scheduling, 20(5), 459\u2013473.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"578_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/opre.2013.1231","volume":"62","author":"M Fischetti","year":"2014","unstructured":"Fischetti, M., & Monaci, M. (2014). Exploiting erraticism in search. Operations Research, 62(1), 114\u2013122.","journal-title":"Operations Research"},{"issue":"4","key":"578_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10951-011-0234-0","volume":"14","author":"A F\u00fcgenschuh","year":"2011","unstructured":"F\u00fcgenschuh, A. (2011). A set partitioning reformulation of a school bus scheduling problem. Journal of Scheduling, 14(4), 307\u2013318.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"578_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207(1), 1\u201314.","journal-title":"European Journal of Operational Research"},{"key":"578_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tre.2015.06.008","volume":"81","author":"\u00c7 Iris","year":"2015","unstructured":"Iris, \u00c7., Pacino, D., Ropke, S., & Larsen, A. (2015). Integrated berth allocation and quay crane assignment problem: Set partitioning models and computational results. Transportation Research Part E: Logistics and Transportation Review, 81, 75\u201397.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"578_CR14","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1016\/j.ejor.2015.10.021","volume":"250","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., & Moreno-Vega, J. M. (2016). A set-partitioning-based model for the berth allocation problem under time-dependent limitations. European Journal of Operational Research, 250(3), 1001\u20131012.","journal-title":"European Journal of Operational Research"},{"key":"578_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.trd.2016.09.013","volume":"60","author":"E Lalla-Ruiz","year":"2018","unstructured":"Lalla-Ruiz, E., Shi, X., & Vo\u00df, S. (2018). The waterway ship scheduling problem. Transportation Research Part D: Transport and Environment, 60, 191\u2013209.","journal-title":"Transportation Research Part D: Transport and Environment"},{"key":"578_CR16","doi-asserted-by":"crossref","unstructured":"Lalla-Ruiz, E., & Vo\u00df, S. (2016a). Improving solver performance through redundancy. Journal of Systems Science and Systems Engineering, 25(3), 303\u2013325.","DOI":"10.1007\/s11518-016-5301-9"},{"key":"578_CR17","doi-asserted-by":"crossref","unstructured":"Lalla-Ruiz, E., & Vo\u00df, S. (2016b). Popmusic as a matheuristic for the berth allocation problem. Annals of Mathematics and Artificial Intelligence, 76(1\u20132), 173\u2013189.","DOI":"10.1007\/s10472-014-9444-4"},{"issue":"1","key":"578_CR18","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ejor.2015.10.062","volume":"251","author":"CO L\u00f3pez","year":"2016","unstructured":"L\u00f3pez, C. O., & Beasley, J. (2016). A formulation space search heuristic for packing unequal circles in a fixed size circular container. European Journal of Operational Research, 251(1), 64\u201373.","journal-title":"European Journal of Operational Research"},{"key":"578_CR19","volume-title":"On- and offline scheduling of bidirectional traffic","author":"E L\u00fcbbecke","year":"2015","unstructured":"L\u00fcbbecke, E. (2015). On- and offline scheduling of bidirectional traffic. Berlin: Logos Verlag Berlin GmbH."},{"key":"578_CR20","unstructured":"Norman, R.J. (1973). An algorithm for the scheduling of vessels through the Panama Canal. Ph.D. thesis, Monterey, California. Naval Postgraduate School."},{"issue":"2","key":"578_CR21","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.ejor.2015.12.007","volume":"251","author":"W Passchyn","year":"2016","unstructured":"Passchyn, W., Coene, S., Briskorn, D., Hurink, J. L., Spieksma, F. C. R., & Berghe, G. V. (2016). The lockmaster\u2019s problem. European Journal of Operational Research, 251(2), 432\u2013441.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"578_CR22","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/S0377-2217(99)00151-4","volume":"119","author":"BD Reyck","year":"1999","unstructured":"Reyck, B. D., & Herroelen, W. (1999). The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research, 119(2), 538\u2013556.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"578_CR23","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s11081-017-9349-2","volume":"18","author":"R Rocha","year":"2017","unstructured":"Rocha, R., Grossmann, I. E., & de Arag\u00e3o, M. V. P. (2017). Petroleum supply planning: Reformulations and a novel decomposition algorithm. Optimization and Engineering, 18(1), 215\u2013240.","journal-title":"Optimization and Engineering"},{"issue":"4","key":"578_CR24","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0305-0483(02)00033-6","volume":"30","author":"WO Rom","year":"2002","unstructured":"Rom, W. O., Tukel, O. I., & Muscatello, J. R. (2002). MRP in a job shop environment using a resource constrained project scheduling model. Omega, 30(4), 275\u2013286.","journal-title":"Omega"},{"key":"578_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-05443-8","volume-title":"Handbook on project management and scheduling","author":"C Schwindt","year":"2015","unstructured":"Schwindt, C., & Zimmermann, J. (2015). Handbook on project management and scheduling (Vol. 1). Berlin: Springer."},{"issue":"10","key":"578_CR26","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"FB Talbot","year":"1982","unstructured":"Talbot, F. B. (1982). Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science, 28(10), 1197\u20131210.","journal-title":"Management Science"},{"issue":"5","key":"578_CR27","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1080\/0305215X.2015.1062094","volume":"48","author":"S Vo\u00df","year":"2016","unstructured":"Vo\u00df, S., & Lalla-Ruiz, E. (2016). A set partitioning reformulation for the multiple-choice multidimensional knapsack problem. Engineering Optimization, 48(5), 831\u2013850.","journal-title":"Engineering Optimization"},{"issue":"6","key":"578_CR28","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.tre.2012.04.007","volume":"48","author":"S Wang","year":"2012","unstructured":"Wang, S., & Meng, Q. (2012). Robust schedule design for liner shipping services. Transportation Research Part E: Logistics and Transportation Review, 48(6), 1093\u20131106.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"578_CR29","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejor.2011.07.012","volume":"216","author":"D Xu","year":"2012","unstructured":"Xu, D., Li, C. L., & Leung, J. Y. T. (2012). Berth allocation with time-dependent physical limitations on vessels. European Journal of Operational Research, 216(1), 47\u201356.","journal-title":"European Journal of Operational Research"},{"key":"578_CR30","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.oceaneng.2015.12.011","volume":"112","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Lin, J., Guo, Z., & Liu, T. (2016). Vessel transportation scheduling optimization based on channel-berth coordination. Ocean Engineering, 112, 145\u2013152.","journal-title":"Ocean Engineering"},{"issue":"3","key":"578_CR31","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1287\/ijoc.1040.0121","volume":"18","author":"G Zhu","year":"2006","unstructured":"Zhu, G., Bard, J. F., & Yu, G. (2006). A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. INFORMS Journal on Computing, 18(3), 377\u2013390.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0578-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0578-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0578-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T17:46:18Z","timestamp":1571593578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0578-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,16]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["578"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0578-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,16]]},"assertion":[{"value":"16 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}