{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T03:54:19Z","timestamp":1768881259958,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,6]],"date-time":"2014-03-06T00:00:00Z","timestamp":1394064000000},"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":[[2016,1]]},"DOI":"10.1007\/s10878-014-9723-3","type":"journal-article","created":{"date-parts":[[2014,3,5]],"date-time":"2014-03-05T08:16:20Z","timestamp":1394007380000},"page":"152-181","source":"Crossref","is-referenced-by-count":14,"title":["The blocking job shop with rail-bound transportation"],"prefix":"10.1007","volume":"31","author":[{"given":"Reinhard","family":"B\u00fcrgy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinz","family":"Gr\u00f6flin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,6]]},"reference":[{"key":"9723_CR1","unstructured":"Aron I, Gen\u00e7-Kaya L, Harjunkoski I, Hoda S, Hooker J (2010) Factory crane scheduling by dynamic programming. In: Wood RK, Dell RF (eds) Operations research, computing and homeland defense (ICS 2011 Proceedings), INFORMS, pp 93\u2013107"},{"issue":"6","key":"9723_CR2","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1287\/opre.43.6.1058","volume":"43","author":"U Bilge","year":"1995","unstructured":"Bilge U, Ulusoy G (1995) A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Oper Res 43(6):1058\u20131070","journal-title":"Oper Res"},{"key":"9723_CR3","doi-asserted-by":"crossref","unstructured":"Brizuela CA, 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, pp 2349\u20132354","DOI":"10.1109\/ICSMC.2001.972908"},{"key":"9723_CR4","volume-title":"Complex scheduling","author":"P Brucker","year":"2011","unstructured":"Brucker P, Knust S (2011) Complex scheduling, 2nd edn. Springer, Berlin","edition":"2"},{"key":"9723_CR5","unstructured":"Brucker P, Strotmann C (2002) Local search procedures for job-shop problems with identical transport robots. In: Eight international workshop on project management and scheduling, Valencia, Spain"},{"issue":"3","key":"9723_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P Brucker","year":"1996","unstructured":"Brucker P, Thiele O (1996) A branch & bound method for the general-shop problem with sequence dependent setup-times. Oper Res Spectr 18(3):145\u2013161","journal-title":"Oper Res Spectr"},{"issue":"2","key":"9723_CR7","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. Oper Res Spectr 28(2):151\u2013176","journal-title":"Oper Res Spectr"},{"issue":"12","key":"9723_CR8","doi-asserted-by":"crossref","first-page":"3200","DOI":"10.1016\/j.cor.2012.04.008","volume":"39","author":"P Brucker","year":"2012","unstructured":"Brucker P, Burke EK, Groenemeyer S (2012) A branch and bound algorithm for the cyclic job-shop problem with transportation. Comput Oper Res 39(12):3200\u20133214","journal-title":"Comput Oper Res"},{"issue":"2","key":"9723_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10878-012-9466-y","volume":"26","author":"R B\u00fcrgy","year":"2013","unstructured":"B\u00fcrgy R, Gr\u00f6flin H (2013) Optimal job insertion in the no-wait job shop. J Comb Optim 26(2):345\u2013371","journal-title":"J Comb Optim"},{"key":"9723_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial optimization","author":"WJ Cook","year":"1997","unstructured":"Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1997) Combinatorial optimization. Wiley, New York"},{"issue":"8","key":"9723_CR11","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1080\/00207540600818286","volume":"46","author":"L Deroussi","year":"2008","unstructured":"Deroussi L, Gourgand M, Tchernev N (2008) A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles. Int J Prod Res 46(8):2143\u20132164","journal-title":"Int J Prod Res"},{"issue":"2","key":"9723_CR12","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(2):763\u2013785","journal-title":"Eur J Oper Res"},{"issue":"17","key":"9723_CR13","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. Discret Appl Math 157(17):3643\u20133655","journal-title":"Discret Appl Math"},{"issue":"2","key":"9723_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10878-009-9278-x","volume":"22","author":"H Gr\u00f6flin","year":"2011","unstructured":"Gr\u00f6flin H, Pham DN, B\u00fcrgy R (2011) The flexible blocking job shop with transfer and set-up times. J Comb Optim 22(2):121\u2013144","journal-title":"J Comb Optim"},{"issue":"1","key":"9723_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ejor.2003.10.034","volume":"162","author":"J Hurink","year":"2005","unstructured":"Hurink J, Knust S (2005) Tabu search algorithms for job-shop problems with a single transport robot. Eur J Oper Res 162(1):99\u2013111","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9723_CR16","doi-asserted-by":"crossref","first-page":"1818","DOI":"10.1016\/j.ejor.2005.02.077","volume":"175","author":"GE Khayat","year":"2006","unstructured":"Khayat GE, Langevin A, Riopel D (2006) Integrated production and material handling scheduling using mathematical programming and constraint programming. Eur J Oper Res 175(3):1818\u20131832","journal-title":"Eur J Oper Res"},{"key":"9723_CR17","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ijpe.2010.07.012","volume":"143","author":"P Locomme","year":"2010","unstructured":"Locomme P, Larabi M, Tchernev N (2010) Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. Int J Prod Econ 143:24","journal-title":"Int J Prod Econ"},{"key":"9723_CR18","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. Carnegie Mellon University, GSIA, Pittsburgh"},{"issue":"3","key":"9723_CR19","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1109\/TRA.2003.810240","volume":"19","author":"JMY Leung","year":"2003","unstructured":"Leung JMY, Zhang G (2003) Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence. IEEE Trans Robot Autom 19(3):480\u2013484","journal-title":"IEEE Trans Robot Autom"},{"issue":"6","key":"9723_CR20","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1287\/opre.1040.0144","volume":"52","author":"JMY Leung","year":"2004","unstructured":"Leung JMY, Zhang G, Yang X, Mak R, Lam K (2004) Optimal cyclic multi-hoist scheduling: a mixed integer programming approach. Oper Res 52(6):965\u2013976","journal-title":"Oper Res"},{"issue":"1","key":"9723_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.ejor.2008.08.019","volume":"198","author":"W Li","year":"2009","unstructured":"Li W, Wu Y, Petering M, Goh M, de Souza R (2009) Discrete time model and algorithms for container yard crane scheduling. Eur J Oper Res 198(1):165\u2013172","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9723_CR22","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1023952906934","volume":"15","author":"MA Manier","year":"2003","unstructured":"Manier MA, Bloch C (2003) A classification for hoist scheduling problems. Int J Flex Manuf Syst 15(1):37\u201355","journal-title":"Int J Flex Manuf Syst"},{"issue":"3","key":"9723_CR23","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1080\/095372800232216","volume":"11","author":"MA Manier","year":"2000","unstructured":"Manier MA, Varnier C, Baptiste P (2000) Constraint-based model for the cyclic multi-hoists scheduling problem. Prod Plan Control 11(3):244\u2013257","journal-title":"Prod Plan Control"},{"issue":"3","key":"9723_CR24","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(3):498\u2013517","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9723_CR25","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2003.11.025","volume":"164","author":"W Ng","year":"2005","unstructured":"Ng W (2005) Crane scheduling in container yards with inter-crane interference. Eur J Oper Res 164(1):64\u201378","journal-title":"Eur J Oper Res"},{"issue":"6","key":"9723_CR26","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(6):797\u2013813","journal-title":"Manag Sci"},{"issue":"2","key":"9723_CR27","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J Orlin","year":"1993","unstructured":"Orlin J (1993) A faster strongly polynomial minimum cost flow algorithm. Oper Res 41(2):338\u2013350","journal-title":"Oper Res"},{"issue":"1","key":"9723_CR28","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s001860200202","volume":"56","author":"J Vygen","year":"2002","unstructured":"Vygen J (2002) On dual minimum cost flow algorithms. Math Methods Oper Res 56(1):101\u2013126","journal-title":"Math Methods Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9723-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9723-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9723-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T04:56:53Z","timestamp":1565240213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9723-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,6]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9723"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9723-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,6]]}}}