{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:02:10Z","timestamp":1770739330155,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T00:00:00Z","timestamp":1560297600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T00:00:00Z","timestamp":1560297600000},"content-version":"vor","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":[[2021,3]]},"DOI":"10.1007\/s10100-019-00630-3","type":"journal-article","created":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T13:05:11Z","timestamp":1560344711000},"page":"291-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Dynamic programming approach for solving the open shop problem"],"prefix":"10.1007","volume":"29","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":[[2019,6,12]]},"reference":[{"issue":"6","key":"630_CR1","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1016\/j.cor.2003.11.018","volume":"32","author":"C Blum","year":"2005","unstructured":"Blum C (2005) Beam-acohybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565\u20131591","journal-title":"Comput Oper Res"},{"issue":"1\u20133","key":"630_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","volume":"76","author":"P Brucker","year":"1997","unstructured":"Brucker P, Hurink J, Jurisch B, W\u00f6stmann B (1997) A branch and bound algorithm for the open-shop problem. Discrete Appl Math 76(1\u20133):43\u201359","journal-title":"Discrete Appl Math"},{"issue":"7","key":"630_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1002\/nav.20102","volume":"52","author":"S Colak","year":"2005","unstructured":"Colak S, Agarwal A (2005) Non-greedy heuristics and augmented neural networks for the open-shop scheduling problem. Nav Res Logist 52(7):631\u2013644","journal-title":"Nav Res Logist"},{"issue":"3","key":"630_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/jos.73","volume":"4","author":"U Dorndorf","year":"2001","unstructured":"Dorndorf U, Pesch E, Phan-Huy T (2001) Solving the open shop scheduling problem. J Sched 4(3):157\u2013174","journal-title":"J Sched"},{"issue":"4","key":"630_CR5","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzalez","year":"1976","unstructured":"Gonzalez T, Sahni S (1976) Open shop scheduling to minimize finish time. J ACM 23(4):665\u2013679","journal-title":"J ACM"},{"key":"630_CR6","doi-asserted-by":"crossref","unstructured":"Grimes D, Hebrard E, Malapert A (2009) Closing the open shop: contradicting conventional wisdom. In: Principles and Practice of Constraint Programming-CP, vol 2009, pp 400\u2013408","DOI":"10.1007\/978-3-642-04244-7_33"},{"issue":"12","key":"630_CR7","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"},{"key":"630_CR8","unstructured":"Gu\u00e9ret C, Prins C (1999) Forbidden intervals for open-shop problems. In: IFORS\u201999"},{"issue":"2","key":"630_CR9","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S0377-2217(99)00488-9","volume":"127","author":"C Gu\u00e9ret","year":"2000","unstructured":"Gu\u00e9ret C, Jussien N, Prins C (2000) Using intelligent backtracking to improve branch-and-bound methods: an application to open-shop problems. Eur J Oper Res 127(2):344\u2013354","journal-title":"Eur J Oper Res"},{"key":"630_CR10","unstructured":"Harmanani HM, Ghosn SB (2016) An efficient method for the open-shop scheduling problem using simulated annealing. In: Information technology: New generations, Springer, pp 1183\u20131193"},{"issue":"2","key":"630_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.1100.0446","volume":"24","author":"A Malapert","year":"2012","unstructured":"Malapert A, Cambazard H, Gu\u00e9ret C, Jussien N, Langevin A, Rousseau LM (2012) An optimal constraint programming approach to the open-shop problem. INFORMS J Comput 24(2):228\u2013244","journal-title":"INFORMS J Comput"},{"key":"630_CR12","unstructured":"Ozolins A (2018) Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times. Oper Res pp 1\u201328"},{"issue":"1","key":"630_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10100-017-0488-5","volume":"27","author":"A Ozolins","year":"2019","unstructured":"Ozolins A (2019) Improved bounded dynamic programming algorithm for solving the blocking flow shop problem. Central Eur J Oper Res 27(1):15\u201338","journal-title":"Central Eur J Oper Res"},{"issue":"6","key":"630_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1504\/IJCSM.2016.081693","volume":"7","author":"P Pongchairerks","year":"2016","unstructured":"Pongchairerks P, Kachitvichyanukul V (2016) A two-level particle swarm optimisation algorithm for open-shop scheduling problem. Int J Comput Sci Math 7(6):575\u2013585","journal-title":"Int J Comput Sci Math"},{"issue":"3","key":"630_CR15","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s001860000090","volume":"52","author":"C Prins","year":"2000","unstructured":"Prins C (2000) Competitive genetic algorithms for the open-shop scheduling problem. Math Methods Oper Res 52(3):389\u2013411","journal-title":"Math Methods Oper Res"},{"issue":"10","key":"630_CR16","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.1016\/j.cor.2007.02.019","volume":"35","author":"D Sha","year":"2008","unstructured":"Sha D, Hsu CY (2008) A new particle swarm optimization for the open shop scheduling problem. Comput Oper Res 35(10):3243\u20133261","journal-title":"Comput Oper Res"},{"issue":"2","key":"630_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":"2","key":"630_CR18","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N Tamura","year":"2009","unstructured":"Tamura N, Taga A, Kitagawa S, Banbara M (2009) Compiling finite linear CSP into SAT. Constraints 14(2):254\u2013272","journal-title":"Constraints"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-019-00630-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-019-00630-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-019-00630-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T09:13:18Z","timestamp":1611997998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-019-00630-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,12]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["630"],"URL":"https:\/\/doi.org\/10.1007\/s10100-019-00630-3","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,12]]},"assertion":[{"value":"12 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}