{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:42:55Z","timestamp":1749494575676,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T00:00:00Z","timestamp":1521590400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002749","name":"Belspo","doi-asserted-by":"crossref","award":["P7\/36"],"award-info":[{"award-number":["P7\/36"]}],"id":[{"id":"10.13039\/501100002749","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10951-018-0560-6","type":"journal-article","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T01:26:17Z","timestamp":1521595577000},"page":"335-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling parallel batching machines in a sequence"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5422-5526","authenticated-orcid":false,"given":"Ward","family":"Passchyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"560_CR1","unstructured":"Adler, M., Sitaraman, R.\u00a0K., Rosenberg, A.\u00a0L., & Unger, W. (1998). Scheduling time-constrained communication in linear networks. In Proceedings of the tenth annual ACM symposium on parallel algorithms and architectures, SPAA \u201998 (pp. 269\u2013278). New York, NY: ACM."},{"key":"560_CR2","unstructured":"Antoniadis, A., Barcelo, N., Cole, D., Fox, K., Moseley, B., Nugent, M., & Pruhs, K. (2014). Packet forwarding algorithms in a line network. In A. Pardo, & A. Viola (Eds.), LATIN 2014: Theoretical informatics: 11th Latin American symposium, Montevideo, Uruguay, March 31\u2013April 4, 2014. Proceedings (pp. 610\u2013621). Berlin: Springer."},{"issue":"1","key":"560_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/B:ANOR.0000030683.64615.c8","volume":"129","author":"P Brucker","year":"2004","unstructured":"Brucker, P., Knust, S., Cheng, T. E., & Shakhlevich, N. V. (2004). Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Annals of Operations Research, 129(1), 81\u2013106.","journal-title":"Annals of Operations Research"},{"key":"560_CR4","doi-asserted-by":"crossref","unstructured":"Disser, Y., Klimm, M., & L\u00fcbbecke, E. (2015). Scheduling bidirectional traffic on a path. Computing Research Repository abs\/1504.07129.","DOI":"10.1007\/978-3-662-47672-7_33"},{"issue":"5","key":"560_CR5","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/opre.14.5.801","volume":"14","author":"O Frank","year":"1966","unstructured":"Frank, O. (1966). Two-way traffic on a single line of railway. Operations Research, 14(5), 801\u2013811.","journal-title":"Operations Research"},{"key":"560_CR6","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cie.2015.03.014","volume":"85","author":"ER Gafarov","year":"2015","unstructured":"Gafarov, E. R., Dolgui, A., & Lazarev, A. A. (2015). Two-station single-track railway scheduling problem with trains of equal speed. Computers and Industrial Engineering, 85, 260\u2013267.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"560_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976). Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3), 237\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"560_CR8","unstructured":"Passchyn, W. (2016). Scheduling locks on inland waterways. Ph.D. thesis, KU Leuven."},{"key":"560_CR9","doi-asserted-by":"crossref","unstructured":"Passchyn, W., Briskorn, D., & Spieksma, F. C. R. (2016a). Mathematical programming models for lock scheduling with an emission objective. European Journal of Operational Research, 248(3), 802\u2013814.","DOI":"10.1016\/j.ejor.2015.09.012"},{"issue":"2","key":"560_CR10","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., & Vanden Berghe, G. (2016b). The lockmaster\u2019s problem. European Journal of Operational Research, 251(2), 432\u2013441.","journal-title":"European Journal of Operational Research"},{"key":"560_CR11","doi-asserted-by":"crossref","unstructured":"Petersen, E. R., & Taylor, A. J. (1988). An optimal scheduling system for the Welland Canal. Transportation Science, 22, 173\u2013185.","DOI":"10.1287\/trsc.22.3.173"},{"key":"560_CR12","unstructured":"Prandtstetter, M., Ritzinger, U., Schmidt, P., & Ruthmair, M. (2015). A variable neighborhood search approach for the interdependent lock scheduling problem. In G. Ochoa, & F. Chicano (Eds.), Evolutionary Computation in Combinatorial Optimization\n                           , volume 9026 of Lecture Notes in Computer Science (pp. 36\u201347). Berlin: Springer."},{"issue":"2","key":"560_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s13676-014-0068-y","volume":"5","author":"G Righini","year":"2016","unstructured":"Righini, G. (2016). A network flow model of the northern Italy waterway system. EURO Journal on Transportation and Logistics, 5(2), 99\u2013122.","journal-title":"EURO Journal on Transportation and Logistics"},{"key":"560_CR14","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.tre.2011.02.005","volume":"47","author":"LD Smith","year":"2011","unstructured":"Smith, L. D., Nauss, R. M., Mattfeld, D. C., Li, J., Ehmke, J. F., & Reindl, M. (2011). Scheduling operations at system choke points with sequence-dependent delays and processing times. Transportation Research Part E, 47, 669\u2013680.","journal-title":"Transportation Research Part E"},{"key":"560_CR15","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1057\/palgrave.jors.2602587","volume":"60","author":"LD Smith","year":"2009","unstructured":"Smith, L. D., Sweeney, D. C., & Campbell, J. F. (2009). Simulation of alternative approaches to relieving congestion at locks in a river transportation system. Journal of the Operational Research Society, 60, 519\u2013533.","journal-title":"Journal of the Operational Research Society"},{"key":"560_CR16","unstructured":"Verstichel, J. (2013). The lock scheduling problem. Ph.D. thesis, KU Leuven."},{"key":"560_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-17419-8_5","volume-title":"Sustainable logistics and supply chains: Innovations and integral approaches","author":"J Verstichel","year":"2016","unstructured":"Verstichel, J., & Vanden Berghe, G. (2016). Scheduling serial locks: A green wave for waterbound logistics. In M. Lu & J. De Bock (Eds.), Sustainable logistics and supply chains: Innovations and integral approaches (pp. 91\u2013109). Berlin: Springer."},{"issue":"2","key":"560_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TSMCC.2008.2007500","volume":"39","author":"ZJ Zhao","year":"2009","unstructured":"Zhao, Z. J., Lau, H. C., & Ge, S. S. (2009). Integrated resource allocation and scheduling in a bidirectional flowshop with multimachine and COS constraints. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 39(2), 190\u2013200.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0560-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0560-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0560-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T10:57:30Z","timestamp":1557917850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0560-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,21]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["560"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0560-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2018,3,21]]},"assertion":[{"value":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}