{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T23:20:18Z","timestamp":1770074418011,"version":"3.49.0"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319899190","type":"print"},{"value":"9783319899206","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89920-6_77","type":"book-chapter","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T16:59:40Z","timestamp":1527267580000},"page":"581-586","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Permutation-Based Neighborhood for the Blocking Job-Shop Problem with Total Tardiness Minimization"],"prefix":"10.1007","author":[{"given":"Julia","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,26]]},"reference":[{"issue":"3","key":"77_CR1","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"A Mascis","year":"2002","unstructured":"Mascis, A., & Pacciarelli, D. (2002). Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research, 143(3), 498\u2013517.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"77_CR2","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.ejor.2006.10.034","volume":"183","author":"A D\u2019Ariano","year":"2007","unstructured":"D\u2019Ariano, A., Pacciarelli, D., & Pranzo, M. (2007). A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research, 183(2), 643\u2013657.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"77_CR3","doi-asserted-by":"publisher","first-page":"2840","DOI":"10.1016\/j.cor.2008.12.012","volume":"36","author":"SQ Liu","year":"2009","unstructured":"Liu, S. Q., & Kozan, E. (2009). Scheduling trains as a blocking parallel-machine job shop scheduling problem. Computers and Operations Research, 36(10), 2840\u20132852.","journal-title":"Computers and Operations Research"},{"key":"77_CR4","doi-asserted-by":"publisher","unstructured":"Lange, J., & Werner, F. (2017). Approaches to modeling train scheduling problems as job-shop problems with blocking constraints. Journal of Scheduling. https:\/\/doi.org\/10.1007\/s10951-017-0526-0 .","DOI":"10.1007\/s10951-017-0526-0"},{"issue":"4","key":"77_CR5","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10951-017-0532-2","volume":"20","author":"R B\u00fcrgy","year":"2017","unstructured":"B\u00fcrgy, R. (2017). A neighborhood for complex job shop scheduling problems with regular objectives. Journal of Scheduling, 20(4), 391\u2013422.","journal-title":"Journal of Scheduling"},{"issue":"17","key":"77_CR6","doi-asserted-by":"publisher","first-page":"3643","DOI":"10.1016\/j.dam.2009.02.020","volume":"157","author":"H Groeflin","year":"2009","unstructured":"Groeflin, H., & Klinkert, A. (2009). A new neighborhood and tabu search for the blocking job shop. Discrete Applied Mathematics, 157(17), 3643\u20133655.","journal-title":"Discrete Applied Mathematics"},{"key":"77_CR7","doi-asserted-by":"crossref","unstructured":"Oddi, A., Rasconi, R., Cesta, A., & Smith, S.\u00a0F. (2012). Iterative improvement algorithms for the blocking job shop. In ICAPS.","DOI":"10.1609\/icaps.v22i1.13530"},{"key":"77_CR8","unstructured":"Pranzo, M., & Pacciarelli, D. (2013). An iterated greedy metaheuristic for the blocking job shop scheduling problem. Journal of Heuristics, 1\u201325."},{"key":"77_CR9","volume-title":"Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques","author":"S Lawrence","year":"1984","unstructured":"Lawrence, S. (1984). Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Pittsburgh: GSIA, Carnegie Mellon University."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2017"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89920-6_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T20:40:37Z","timestamp":1693687237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89920-6_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319899190","9783319899206"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89920-6_77","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"value":"0721-5924","type":"print"},{"value":"2197-9294","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}