{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:03:36Z","timestamp":1765609416023},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,11,12]],"date-time":"2009-11-12T00:00:00Z","timestamp":1257984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10878-009-9278-x","type":"journal-article","created":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T22:31:17Z","timestamp":1257978677000},"page":"121-144","source":"Crossref","is-referenced-by-count":30,"title":["The flexible blocking job shop with transfer and set-up times"],"prefix":"10.1007","volume":"22","author":[{"given":"Heinz","family":"Gr\u00f6flin","sequence":"first","affiliation":[]},{"given":"Dinh Nguyen","family":"Pham","sequence":"additional","affiliation":[]},{"given":"Reinhard","family":"B\u00fcrgy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,12]]},"reference":[{"key":"9278_CR1","doi-asserted-by":"crossref","unstructured":"Brizuela C, Zhao Y, Sannomiya N (2001) No-wait and blocking job-shops: challenging problems for ga\u2019s. In: IEEE international conference on systems, man, and cybernetics, vol 4, pp 2349\u20132354","DOI":"10.1109\/ICSMC.2001.972908"},{"issue":"1","key":"9278_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10479-007-0276-z","volume":"159","author":"P Brucker","year":"2008","unstructured":"Brucker P, Kampmeyer T (2008) Cyclic job shop scheduling problems with blocking. Ann Oper Res 159(1):161\u2013181","journal-title":"Ann Oper Res"},{"key":"9278_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s00291-005-0008-1","volume":"28","author":"P Brucker","year":"2006","unstructured":"Brucker P, Heitmann S, Hurink J, Nieberg T (2006) Job-shop scheduling with limited capacity buffers. OR Spectrum 28:151\u2013176","journal-title":"OR Spectrum"},{"key":"9278_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, Boston"},{"key":"9278_CR5","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/j.ejor.2005.12.025","volume":"177","author":"H Gr\u00f6flin","year":"2007","unstructured":"Gr\u00f6flin H, Klinkert A (2007) Feasible insertions in job shop scheduling, short cycles and stable sets. Eur J Oper Res 177:763\u2013785","journal-title":"Eur J Oper Res"},{"issue":"17","key":"9278_CR6","doi-asserted-by":"crossref","first-page":"3643","DOI":"10.1016\/j.dam.2009.02.020","volume":"157","author":"H Gr\u00f6flin","year":"2009","unstructured":"Gr\u00f6flin H, Klinkert A (2009) A new neighborhood and tabu search for the blocking job shop. Discrete Appl Math 157(17):3643\u20133655","journal-title":"Discrete Appl Math"},{"key":"9278_CR7","unstructured":"Heitmann S (2007) Job-shop scheduling with limited buffer capacities. PhD thesis, University Osnabr\u00fcck, Germany"},{"key":"9278_CR8","unstructured":"Klinkert A (2001) Optimization in design and control of automated high-density warehouses. PhD thesis, University of Fribourg, Switzerland"},{"key":"9278_CR9","unstructured":"Mascis A, Pacciarelli D (2000) Machine scheduling via alternative graphs. Internal Report RT-DIA-46-2000, Universit\u00e0 degli Studi Roma Tre, Dipartimento di Informatica e Automazione, Italy"},{"key":"9278_CR10","doi-asserted-by":"crossref","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. Eur J Oper Res 143:498\u2013517","journal-title":"Eur J Oper Res"},{"key":"9278_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/B:ANOR.0000039520.24932.4b","volume":"131","author":"C Meloni","year":"2004","unstructured":"Meloni C, Pacciarelli D, Pranzo M (2004) A rollout metaheuristic for job shop scheduling problems. Ann Oper Res 131:215\u2013235","journal-title":"Ann Oper Res"},{"key":"9278_CR12","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42:797\u2013812","journal-title":"Manag Sci"},{"key":"9278_CR13","unstructured":"Pham DN (2008) Complex job shop scheduling: Formulations, algorithms and a healthcare application. PhD thesis, University of Fribourg, Switzerland"},{"key":"9278_CR14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/S0377-2217(02)00524-6","volume":"152","author":"HW Thornton","year":"2004","unstructured":"Thornton HW, Hunsucker JL (2004) A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. Eur J Oper Res 152:96\u2013114","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9278-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9278-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9278-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9278-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,12]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9278"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9278-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,12]]}}}