{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T15:36:41Z","timestamp":1763480201215,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T00:00:00Z","timestamp":1505347200000},"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":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10100-017-0488-5","type":"journal-article","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T07:35:32Z","timestamp":1505374532000},"page":"15-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Improved bounded dynamic programming algorithm for solving the blocking flow shop problem"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6550-5291","authenticated-orcid":false,"given":"Ansis","family":"Ozolins","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,14]]},"reference":[{"issue":"6","key":"488_CR1","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1016\/j.engappai.2011.09.001","volume":"25","author":"J Bautista","year":"2012","unstructured":"Bautista J, Cano A, Companys R, Ribas I (2012) Solving the $$Fm|block|Cmax$$ F m | b l o c k | C m a x problem using bounded dynamic programming. Eng Appl Artif Intell 25(6):1235\u20131245","journal-title":"Eng Appl Artif Intell"},{"issue":"4","key":"488_CR2","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1016\/j.cor.2005.05.018","volume":"34","author":"R Companys","year":"2007","unstructured":"Companys R, Mateo M (2007) Different behaviour of a double branch-and-bound algorithm on $$Fm|prmu|Cmax$$ F m | p r m u | C m a x and $$Fm|block|Cmax$$ F m | b l o c k | C m a x problems. Comput Oper Res 34(4):938\u2013953","journal-title":"Comput Oper Res"},{"key":"488_CR3","unstructured":"Companys R, Ribas I (2011) New insights on the blocking flow shop problem. Best solutions update. Tech. rep., working paper"},{"issue":"5","key":"488_CR4","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P Gilmore","year":"1964","unstructured":"Gilmore P, Gomory R (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12(5):655\u2013679","journal-title":"Oper Res"},{"issue":"3","key":"488_CR5","first-page":"302","volume":"35","author":"J Grabowski","year":"2007","unstructured":"Grabowski J, Pempera J (2007) The permutation flow shop problem with blocking. A tabu search approach. Omega 35(3):302\u2013311","journal-title":"A tabu search approach. Omega"},{"issue":"12","key":"488_CR6","doi-asserted-by":"publisher","first-page":"2968","DOI":"10.1016\/j.cor.2012.02.024","volume":"39","author":"J Gromicho","year":"2012","unstructured":"Gromicho J, Van Hoorn J, Saldanha-da Gama F, Timmer G (2012) Solving the job-shop scheduling problem optimally by dynamic programming. Comput Oper Res 39(12):2968\u20132977","journal-title":"Comput Oper Res"},{"issue":"3","key":"488_CR7","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"N Hall","year":"1996","unstructured":"Hall N, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper res 44(3):510\u2013525","journal-title":"Oper res"},{"issue":"2","key":"488_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/opre.8.2.178","volume":"8","author":"J Heller","year":"1960","unstructured":"Heller J (1960) Some numerical experiments for an $$M\\times J$$ M \u00d7 J flow shop and its decision-theoretical aspects. Oper Res 8(2):178\u2013184","journal-title":"Oper Res"},{"key":"488_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J Lenstra","year":"1977","unstructured":"Lenstra J, Rinnooy Kan A, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrec Math 1:343\u2013362","journal-title":"Ann Discrec Math"},{"issue":"2","key":"488_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.omega.2012.03.006","volume":"41","author":"S Lin","year":"2013","unstructured":"Lin S, Ying K (2013) Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. Omega 41(2):383\u2013389","journal-title":"Omega"},{"issue":"3","key":"488_CR11","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TASE.2012.2219860","volume":"10","author":"Q Pan","year":"2013","unstructured":"Pan Q, Wang L, Sang H, Li J, Liu M (2013) A high performing memetic algorithm for the flowshop scheduling problem with blocking. IEEE Trans Auto Sci Eng 10(3):741\u2013756","journal-title":"IEEE Trans Auto Sci Eng"},{"issue":"3","key":"488_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/322203.322213","volume":"27","author":"C Papadimitriou","year":"1980","unstructured":"Papadimitriou C, Kanellakis P (1980) Flowshop scheduling with limited temporary storage. J ACM (JACM) 27(3):533\u2013549","journal-title":"J ACM (JACM)"},{"key":"488_CR13","doi-asserted-by":"crossref","unstructured":"Reddi S, Ramamoorthy C (1972) On the flow-shop sequencing problem with no wait in process. Oper Res Quart pp 323\u2013331","DOI":"10.1057\/jors.1972.52"},{"issue":"1","key":"488_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"C Reeves","year":"1995","unstructured":"Reeves C (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5\u201313","journal-title":"Comput Oper Res"},{"issue":"3","key":"488_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"I Ribas","year":"2011","unstructured":"Ribas I, Companys R, Tort-Martorell X (2011) An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39(3):293\u2013301","journal-title":"Omega"},{"issue":"1","key":"488_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-005-2444-3","volume":"138","author":"D Ronconi","year":"2005","unstructured":"Ronconi D (2005) A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking. Ann Oper Res 138(1):53\u201365","journal-title":"Ann Oper Res"},{"issue":"2","key":"488_CR17","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"issue":"7","key":"488_CR18","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1016\/j.cor.2013.01.005","volume":"40","author":"M Tasgetiren","year":"2013","unstructured":"Tasgetiren M, Pan Q, Suganthan P, Buyukdagli O (2013) A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. Comput Oper Res 40(7):1729\u20131743","journal-title":"Comput Oper Res"},{"key":"488_CR19","doi-asserted-by":"crossref","unstructured":"Tasgetiren M, Pan Q, Kizilay D, Suer G (2015) A populated local search with differential evolution for blocking flowshop scheduling problem. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp 2789\u20132796","DOI":"10.1109\/CEC.2015.7257235"},{"key":"488_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"M Tasgetiren","year":"2017","unstructured":"Tasgetiren M, Kizilay D, Pan Q, Suganthan P (2017) Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput Oper Res 77:111\u2013126","journal-title":"Comput Oper Res"},{"key":"488_CR21","unstructured":"van Hoorn JJ (2016) Dynamic programming for routing and scheduling: Optimizing sequences of decisions"},{"key":"488_CR22","doi-asserted-by":"crossref","unstructured":"van Hoorn JJ, Nogueira A, Ojea I, Gromicho JA (2016) An corrigendum on the paper: solving the job-shop scheduling problem optimally by dynamic programming. Comput Oper Res","DOI":"10.1016\/j.cor.2016.09.001"},{"issue":"3","key":"488_CR23","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L Wang","year":"2010","unstructured":"Wang L, Pan Q, Suganthan P, Wang W, Wang Y (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37(3):509\u2013520","journal-title":"Comput Oper Res"},{"key":"488_CR24","doi-asserted-by":"crossref","unstructured":"Zhang C, Xie Z, Shao X, Tian G (2015) An effective VNSSA algorithm for the blocking flowshop scheduling problem with makespan minimization. In: 2015 International Conference on Advanced Mechatronic Systems (ICAMechS), IEEE, pp 86\u201389","DOI":"10.1109\/ICAMechS.2015.7287134"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-017-0488-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0488-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0488-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T09:16:26Z","timestamp":1570094186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-017-0488-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,14]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["488"],"URL":"https:\/\/doi.org\/10.1007\/s10100-017-0488-5","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2017,9,14]]}}}