{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T15:21:53Z","timestamp":1782400913048,"version":"3.54.5"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T00:00:00Z","timestamp":1557532800000},"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":["Math. Prog. Comp."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s12532-019-00162-6","type":"journal-article","created":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T17:09:31Z","timestamp":1557594571000},"page":"703-754","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["New exact approaches to row layout problems"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2812-043X","authenticated-orcid":false,"given":"Anja","family":"Fischer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5154-6594","authenticated-orcid":false,"given":"Frank","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,11]]},"reference":[{"key":"162_CR1","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.cie.2017.03.015","volume":"107","author":"A Ahmadi","year":"2017","unstructured":"Ahmadi, A., Pishvaee, M.S., Jokar, M.R.A.: A survey on multi-floor facility layout problems. Comput. Ind. Eng. 107, 158\u2013170 (2017). \n                    https:\/\/doi.org\/10.1016\/j.cie.2017.03.015","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"162_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ejor.2013.07.010","volume":"232","author":"H Ahonen","year":"2014","unstructured":"Ahonen, H., de Alvarenga, A.G., Amaral, A.R.S.: Simulated annealing and tabu search approaches for the corridor allocation problem. Eur. J. Oper. Res. 232(1), 221\u2013233 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"162_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1080\/00207543.2018.1457811","volume":"57","author":"AR Amaral","year":"2019","unstructured":"Amaral, A.R.: A mixed-integer programming formulation for the double row layout of machines in manufacturing systems. Int. J. Prod. Res. 57(1), 34\u201347 (2019). \n                    https:\/\/doi.org\/10.1080\/00207543.2018.1457811","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"162_CR4","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.ejor.2004.12.021","volume":"173","author":"ARS Amaral","year":"2006","unstructured":"Amaral, A.R.S.: On the exact solution of a facility layout problem. Eur. J. Oper. Res. 173(2), 508\u2013518 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"162_CR5","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1287\/opre.1080.0548","volume":"56","author":"ARS Amaral","year":"2008","unstructured":"Amaral, A.R.S.: An exact approach to the one-dimensional facility layout problem. Oper. Res. 56(4), 1026\u20131033 (2008). \n                    https:\/\/doi.org\/10.1287\/opre.1080.0548","journal-title":"Oper. Res."},{"issue":"4","key":"162_CR6","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s11590-009-0130-0","volume":"3","author":"ARS Amaral","year":"2009","unstructured":"Amaral, A.R.S.: A mixed 0\u20131 linear programming formulation for the exact solution of the minimum linear arrangement problem. Optim. Lett. 3(4), 513\u2013520 (2009)","journal-title":"Optim. Lett."},{"issue":"1","key":"162_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.dam.2008.06.002","volume":"157","author":"ARS Amaral","year":"2009","unstructured":"Amaral, A.R.S.: A new lower bound for the single row facility layout problem. Discrete Appl. Math. 157(1), 183\u2013190 (2009)","journal-title":"Discrete Appl. Math."},{"key":"162_CR8","unstructured":"Amaral, A.R.S.: On duplex arrangement of vertices. Technical report, Departamento de Inform\u00e1tica, Universidade Federal do Esp\u00edrito Santo (UFES), Brazil (2011)"},{"issue":"12","key":"162_CR9","doi-asserted-by":"publisher","first-page":"3325","DOI":"10.1016\/j.cor.2012.04.016","volume":"39","author":"ARS Amaral","year":"2012","unstructured":"Amaral, A.R.S.: The corridor allocation problem. Comput. Oper. Res. 39(12), 3325\u20133330 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"162_CR10","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11590-011-0426-8","volume":"7","author":"ARS Amaral","year":"2013","unstructured":"Amaral, A.R.S.: Optimal solutions for the double row layout problem. Optim. Lett. 7(2), 407\u2013413 (2013)","journal-title":"Optim. Lett."},{"issue":"12","key":"162_CR11","doi-asserted-by":"publisher","first-page":"2930","DOI":"10.1016\/j.cor.2013.07.003","volume":"40","author":"ARS Amaral","year":"2013","unstructured":"Amaral, A.R.S.: A parallel ordering problem in facilities layout. Comput. Oper. Res. 40(12), 2930\u20132939 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20132","key":"162_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10107-012-0533-z","volume":"141","author":"ARS Amaral","year":"2013","unstructured":"Amaral, A.R.S., Letchford, A.N.: A polyhedral approach to the single row facility layout problem. Math. Program. 141(1\u20132), 453\u2013477 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"162_CR13","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ejor.2018.04.008","volume":"270","author":"MF Anjos","year":"2018","unstructured":"Anjos, M.F., Fischer, A., Hungerl\u00e4nder, P.: Improved exact approaches for row layout problems with departments of equal length. Eur. J. Oper. Res. 270(2), 514\u2013529 (2018). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2018.04.008","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"162_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.disopt.2005.03.001","volume":"2","author":"MF Anjos","year":"2005","unstructured":"Anjos, M.F., Kennings, A., Vannelli, A.: A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optim. 2(2), 113\u2013122 (2005)","journal-title":"Discrete Optim."},{"key":"162_CR15","first-page":"849","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science","author":"MF Anjos","year":"2012","unstructured":"Anjos, M.F., Liers, F.: Global approaches for facility layout and VLSI floorplanning. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, vol. 166, pp. 849\u2013877. Springer, New York (2012)"},{"issue":"4","key":"162_CR16","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/ijoc.1080.0270","volume":"20","author":"MF Anjos","year":"2008","unstructured":"Anjos, M.F., Vannelli, A.: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J. Comput. 20(4), 611\u2013617 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"162_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2017.01.049","volume":"261","author":"MF Anjos","year":"2017","unstructured":"Anjos, M.F., Vieira, M.V.: Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions. Eur. J. Oper. Res. 261(1), 1\u201316 (2017). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2017.01.049","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"162_CR18","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1080\/10556780902917735","volume":"24","author":"MF Anjos","year":"2009","unstructured":"Anjos, M.F., Yen, G.: Provably near-optimal solutions for very large single-row facility layout problems. Optim. Methods Softw. 24(4), 805\u2013817 (2009)","journal-title":"Optim. Methods Softw."},{"key":"162_CR19","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.jmsy.2016.12.008","volume":"42","author":"MM Azevedo","year":"2017","unstructured":"Azevedo, M.M., Crispim, J.A., de Sousa, J.P.: A dynamic multi-objective approach for the reconfigurable multi-facility layout problem. J. Manuf. Syst. 42, 140\u2013152 (2017). \n                    https:\/\/doi.org\/10.1016\/j.jmsy.2016.12.008","journal-title":"J. Manuf. Syst."},{"key":"162_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-96271-9_3","volume-title":"Simulation Science","author":"U Bracht","year":"2018","unstructured":"Bracht, U., Dahlbeck, M., Fischer, A., Kr\u00fcger, T.: Combining simulation and optimization for extended double row facility layout problems in factory planning. In: Baum, M., Brenner, G., Grabowski, J., Hanschke, T., Hartmann, S., Sch\u00f6bel, A. (eds.) Simulation Science, pp. 39\u201359. Springer International Publishing, Cham (2018)"},{"issue":"2","key":"162_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s003570000019","volume":"17","author":"M Brusco","year":"2000","unstructured":"Brusco, M., Stahl, S.: Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. J. Classif. 17(2), 197\u2013223 (2000)","journal-title":"J. Classif."},{"issue":"3","key":"162_CR22","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s12532-011-0027-7","volume":"3","author":"A Caprara","year":"2011","unstructured":"Caprara, A., Oswald, M., Reinelt, G., Schwarz, R., Traversi, E.: Optimal linear arrangements using betweenness variables. Math. Program. Comput. 3(3), 261\u2013280 (2011). \n                    https:\/\/doi.org\/10.1007\/s12532-011-0027-7","journal-title":"Math. Program. Comput."},{"issue":"3","key":"162_CR23","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0377-2217(03)00296-0","volume":"157","author":"I Castillo","year":"2004","unstructured":"Castillo, I., Peters, B.A.: Integrating design and production planning considerations in multi-bay manufacturing facility layout. Eur. J. Oper. Res. 157(3), 671\u2013687 (2004)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"162_CR24","doi-asserted-by":"publisher","first-page":"237","DOI":"10.3923\/jas.2014.245.251","volume":"14","author":"J Chung","year":"2014","unstructured":"Chung, J., Suh, Y.: Analysis on the pier-type material flow pattern for facility layout applications. J. Appl. Sci. 14(3), 237\u2013244 (2014)","journal-title":"J. Appl. Sci."},{"issue":"3","key":"162_CR25","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/00207540802192126","volume":"48","author":"J Chung","year":"2010","unstructured":"Chung, J., Tanchoco, J.: The double row layout problem. Int. J. Prod. Res. 48(3), 709\u2013727 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"162_CR26","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.ejor.2011.03.034","volume":"213","author":"D Datta","year":"2011","unstructured":"Datta, D., Amaral, A.R.S., Figueira, J.R.: Single row facility layout problem using a permutation-based genetic algorithm. Eur. J. Oper. Res. 213(2), 388\u2013394 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"162_CR27","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.jmatprotec.2004.09.012","volume":"157\u2013158","author":"M Ficko","year":"2004","unstructured":"Ficko, M., Brezocnik, M., Balic, J.: Designing the layout of single- and multiple-rows flexible manufacturing system by genetic algorithms. J. Mater. Process. Technol. 157\u2013158, 150\u2013158 (2004)","journal-title":"J. Mater. Process. Technol."},{"key":"162_CR28","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-42902-1_17","volume-title":"Operations Research Proceedings","author":"Anja Fischer","year":"2017","unstructured":"Fischer, A., Fischer, F., Hungerl\u00e4nder, P.: A new exact approach to the space-free double row layout problem. In: Doerner, K.F., Ljubic, I., Pflug, G., Tragler, G. (eds.) Operations Research Proceedings 2015, Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, \u00d6GOR, SVOR\/ASRO), University of Vienna, Austria, September 1\u20134, 2015, Operations Research Proceedings, pp. 125\u2013130. Springer (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-42902-1_17"},{"key":"162_CR29","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2653716","author":"A Fischer","year":"2019","unstructured":"Fischer, A., Fischer, F., Hungerl\u00e4nder, P.: Program code to new exact approaches to row layout problems (2019). \n                    https:\/\/doi.org\/10.5281\/zenodo.2653716","journal-title":"Program code to new exact approaches to row layout problems"},{"key":"162_CR30","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"3","key":"162_CR31","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"162_CR32","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.24.4.595","volume":"24","author":"A Geoffrion","year":"1976","unstructured":"Geoffrion, A., Graves, G.: Scheduling parallel production lines with changeover costs: practical applications of a quadratic assignment\/LP approach. Oper. Res. 24, 595\u2013610 (1976)","journal-title":"Oper. Res."},{"issue":"6","key":"162_CR33","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32(6), 1195\u20131220 (1984)","journal-title":"Oper. Res."},{"key":"162_CR34","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Facets of the linear ordering polytope. Math. Program. 33, 43\u201360 (1985)","journal-title":"Math. Program."},{"issue":"3","key":"162_CR35","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.ejor.2015.08.014","volume":"248","author":"J Guan","year":"2016","unstructured":"Guan, J., Lin, G.: Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem. Eur. J. Oper. Res. 248(3), 899\u2013909 (2016). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2015.08.014","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"162_CR36","doi-asserted-by":"publisher","first-page":"2559","DOI":"10.1080\/00207549408957084","volume":"32","author":"MMD Hassan","year":"1994","unstructured":"Hassan, M.M.D.: Machine layout problem in modern manufacturing facilities. Int. J. Prod. Res. 32(11), 2559\u20132584 (1994)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"162_CR37","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/opre.36.2.258","volume":"36","author":"SS Heragu","year":"1988","unstructured":"Heragu, S.S., Kusiak, A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258\u2013268 (1988)","journal-title":"Oper. Res."},{"issue":"1","key":"162_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0377-2217(91)90088-D","volume":"53","author":"SS Heragu","year":"1991","unstructured":"Heragu, S.S., Kusiak, A.: Efficient models for the facility layout problem. Eur. J. Oper. Res. 53(1), 1\u201313 (1991)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"162_CR39","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s00170-017-0895-8","volume":"94","author":"H Hosseini-Nasab","year":"2018","unstructured":"Hosseini-Nasab, H., Fereidouni, S., Fatemi Ghomi, S.M.T., Fakhrzad, M.B.: Classification of facility layout problems: a review study. Int. J. Adv. Manuf. Technol. 94(1), 957\u2013977 (2018). \n                    https:\/\/doi.org\/10.1007\/s00170-017-0895-8","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"162_CR40","unstructured":"Hungerl\u00e4nder, P.: A semidefinite optimization approach to the parallel row ordering problem. Technical report, Alpen-Adria Universit\u00e4t Klagenfurt, Mathematics, Optimization Group, TR-ARUK-M-O-14-05 (2014)"},{"issue":"5","key":"162_CR41","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1080\/00207543.2013.828163","volume":"52","author":"P Hungerl\u00e4nder","year":"2014","unstructured":"Hungerl\u00e4nder, P.: Single-row equidistant facility layout as a special case of single-row facility layout. Int. J. Prod. Res. 52(5), 1257\u20131268 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"162_CR42","unstructured":"Hungerl\u00e4nder, P., Anjos, M.F.: A semidefinite optimization approach to space-free multi-row facility layout. Cahiers du GERAD G-2012-03, GERAD, Montreal, QC, Canada (2012)"},{"issue":"1","key":"162_CR43","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ejor.2015.02.049","volume":"245","author":"P Hungerl\u00e4nder","year":"2015","unstructured":"Hungerl\u00e4nder, P., Anjos, M.F.: A semidefinite optimization-based approach for global optimization of multi-row facility layout. Eur. J. Oper. Res. 245(1), 46\u201361 (2015). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2015.02.049","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"162_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-012-9505-8","volume":"55","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder, P., Rendl, F.: A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. 55(1), 1\u201320 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"162_CR45","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10107-012-0627-7","volume":"140","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder, P., Rendl, F.: Semidefinite relaxations of ordering problems. Math. Program. 140(1), 77\u201397 (2013)","journal-title":"Math. Program."},{"key":"162_CR46","unstructured":"IBM ILOG CPLEX V12.8 User\u2019s Manual for CPLEX (2018)"},{"key":"162_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/03155986.2017.1393729","volume":"57","author":"B Keller","year":"2017","unstructured":"Keller, B.: Construction heuristics for the single row layout problem with machine-spanning clearances. INFOR 57, 1\u201324 (2017). \n                    https:\/\/doi.org\/10.1080\/03155986.2017.1393729","journal-title":"INFOR"},{"issue":"3","key":"162_CR48","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.ejor.2015.03.016","volume":"245","author":"B Keller","year":"2015","unstructured":"Keller, B., Buscher, U.: Single row layout models. Eur. J. Oper. Res. 245(3), 629\u2013644 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"162_CR49","unstructured":"Kothari, R., Ghosh, D.: Population heuristics for the corridor allocation problem. Technical report, working paper, Indian Institute of Management Ahmedabad (2012)"},{"issue":"4","key":"162_CR50","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s12597-012-0091-4","volume":"49","author":"R Kothari","year":"2012","unstructured":"Kothari, R., Ghosh, D.: The single row facility layout problem: state of the art. OPSEARCH 49(4), 442\u2013462 (2012). \n                    https:\/\/doi.org\/10.1007\/s12597-012-0091-4","journal-title":"OPSEARCH"},{"issue":"1","key":"162_CR51","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.cor.2012.05.017","volume":"40","author":"R Kothari","year":"2013","unstructured":"Kothari, R., Ghosh, D.: Insertion based Lin\u2013Kernighan heuristic for single row facility layout. Comput. Oper. Res. 40(1), 129\u2013136 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"162_CR52","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2012.07.037","volume":"224","author":"R Kothari","year":"2013","unstructured":"Kothari, R., Ghosh, D.: Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods. Eur. J. Oper. Res. 224(1), 93\u2013100 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"162_CR53","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11590-012-0605-2","volume":"8","author":"R Kothari","year":"2014","unstructured":"Kothari, R., Ghosh, D.: An efficient genetic algorithm for single row facility layout. Optim. Lett. 8(2), 679\u2013690 (2014)","journal-title":"Optim. Lett."},{"issue":"2","key":"162_CR54","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10732-013-9234-x","volume":"20","author":"R Kothari","year":"2014","unstructured":"Kothari, R., Ghosh, D.: A scatter search algorithm for the single row facility layout problem. J. Heuristics 20(2), 125\u2013142 (2014)","journal-title":"J. Heuristics"},{"issue":"3","key":"162_CR55","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0377-2217(88)90227-5","volume":"35","author":"G Laporte","year":"1988","unstructured":"Laporte, G., Mercure, H.: Balancing hydraulic turbine runners: a quadratic assignment problem. Eur. J. Oper. Res. 35(3), 378\u2013381 (1988)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"162_CR56","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"162_CR57","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/03155986.1976.11731633","volume":"14","author":"R Love","year":"1976","unstructured":"Love, R., Wong, J.: On solving a one-dimensional space allocation problem with integer programming. INFOR 14(2), 139\u2013143 (1976). \n                    https:\/\/doi.org\/10.1080\/03155986.1976.11731633","journal-title":"INFOR"},{"issue":"2","key":"162_CR58","doi-asserted-by":"publisher","first-page":"467","DOI":"10.22059\/ijms.2017.216663.672285","volume":"10","author":"M Maadi","year":"2017","unstructured":"Maadi, M., Javidnia, M., Jamshidi, R.: Two strategies based on meta-heuristic algorithms for parallel row ordering problem (PROP). Iran. J. Manag. Stud. 10(2), 467\u2013498 (2017). \n                    https:\/\/doi.org\/10.22059\/ijms.2017.216663.672285","journal-title":"Iran. J. Manag. Stud."},{"issue":"5","key":"162_CR59","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1080\/002075497195290","volume":"35","author":"RD Meller","year":"1997","unstructured":"Meller, R.D.: The multi-bay manufacturing facility layout problem. Int. J. Prod. Res. 35(5), 1229\u20131237 (1997)","journal-title":"Int. J. Prod. Res."},{"issue":"20","key":"162_CR60","doi-asserted-by":"publisher","first-page":"6129","DOI":"10.1080\/00207543.2013.803168","volume":"51","author":"CC Murray","year":"2013","unstructured":"Murray, C.C., Smith, A.E., Zhang, Z.: An efficient local search heuristic for the double row layout problem with asymmetric material flow. Int. J. Prod. Res. 51(20), 6129\u20136139 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"20","key":"162_CR61","doi-asserted-by":"publisher","first-page":"5872","DOI":"10.1080\/00207543.2011.636386","volume":"50","author":"F Ozcelik","year":"2012","unstructured":"Ozcelik, F.: A hybrid genetic algorithm for the single row layout problem. Int. J. Prod. Res. 50(20), 5872\u20135886 (2012). \n                    https:\/\/doi.org\/10.1080\/00207543.2011.636386","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"162_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-010-0204-5","volume":"34","author":"G Palubeckis","year":"2012","unstructured":"Palubeckis, G.: A branch-and-bound algorithm for the single-row equidistant facility layout problem. OR Spectr. 34(1), 1\u201321 (2012). \n                    https:\/\/doi.org\/10.1007\/s00291-010-0204-5","journal-title":"OR Spectr."},{"issue":"3","key":"162_CR63","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.ejor.2015.05.055","volume":"246","author":"G Palubeckis","year":"2015","unstructured":"Palubeckis, G.: Fast local search for single row facility layout. Eur. J. Oper. Res. 246(3), 800\u2013814 (2015). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2015.05.055","journal-title":"Eur. J. Oper. Res."},{"key":"162_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2016.09.026","volume":"103","author":"G Palubeckis","year":"2017","unstructured":"Palubeckis, G.: Single row facility layout using multi-start simulated annealing. Comput. Ind. Eng. 103, 1\u201316 (2017). \n                    https:\/\/doi.org\/10.1016\/j.cie.2016.09.026","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"162_CR65","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ejor.2009.11.034","volume":"205","author":"H Samarghandi","year":"2010","unstructured":"Samarghandi, H., Eshghi, K.: An efficient tabu algorithm for the single row facility layout problem. Eur. J. Oper. Res. 205(1), 98\u2013105 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"162_CR66","doi-asserted-by":"publisher","first-page":"1861","DOI":"10.1016\/j.dam.2010.07.005","volume":"158","author":"S Sanjeevi","year":"2010","unstructured":"Sanjeevi, S., Kianfar, K.: A polyhedral study of triplet formulation for single row facility layout problem. Discrete Appl. Math. 158, 1861\u20131867 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"162_CR67","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0377-2217(97)00065-9","volume":"105","author":"B Sarker","year":"1998","unstructured":"Sarker, B., Wilhelm, W., Hogg, G.: One-dimensional machine location problems in a multi-product flowline with equidistant locations. Eur. J. Oper. Res. 105(3), 401\u2013426 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"162_CR68","unstructured":"Secchin, L.D., Amaral, A.R.S.: Disposi\u00e7\u00e3o de facilidades em fila dupla via programa\u00e7\u00e3o inteira mista. In: XLVI SBPO - Simp\u00f3sio Brasileiro de Pesquisa Operacional, pp. 2327\u20132334 (2014). \n                    http:\/\/ws2.din.uem.br\/~ademir\/sbpo\/sbpo2014\/pdf\/arq0354.pdf"},{"issue":"1","key":"162_CR69","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11590-018-1263-9","volume":"13","author":"LD Secchin","year":"2019","unstructured":"Secchin, L.D., Amaral, A.R.S.: An improved mixed-integer programming model for the double row layout of facilities. Optim. Lett. 13(1), 193\u2013199 (2019). \n                    https:\/\/doi.org\/10.1007\/s11590-018-1263-9","journal-title":"Optim. Lett."},{"key":"162_CR70","unstructured":"Smith, A.E., Murray, C.C., Zuo, X.: An extended double row layout problem. In: Proceedings of the 12th International Material Handling Research Colloquium, pp. 554\u2013569 (2012)"},{"key":"162_CR71","doi-asserted-by":"publisher","unstructured":"Tang, L., Zuo, X., Wang, C., Zhao, X.: A moea\/d based approach for solving robust double row layout problem. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 1966\u20131973 (2015). \n                    https:\/\/doi.org\/10.1109\/CEC.2015.7257126","DOI":"10.1109\/CEC.2015.7257126"},{"key":"162_CR72","unstructured":"Tucker, A.W.: On directed graphs and integer programs. Technical report, IBM Mathematical Research Project (1960)"},{"key":"162_CR73","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.asoc.2015.08.023","volume":"37","author":"S Wang","year":"2015","unstructured":"Wang, S., Zuo, X., Liu, X., Zhao, X., Li, J.: Solving dynamic double row layout problem via combining simulated annealing and mathematical programming. Appl. Soft Comput. 37, 303\u2013310 (2015). \n                    https:\/\/doi.org\/10.1016\/j.asoc.2015.08.023","journal-title":"Appl. Soft Comput."},{"key":"162_CR74","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-30113-4_12","volume-title":"Software and Compilers for Embedded Systems, Lecture Notes in Computer Science","author":"B Wess","year":"2004","unstructured":"Wess, B., Zeitlhofer, T.: On the phase coupling problem between data memory layout generation and address pointer assignment. In: Schepers, H. (ed.) Software and Compilers for Embedded Systems, Lecture Notes in Computer Science, vol. 3199, pp. 152\u2013166. Springer, Berlin Heidelberg (2004)"},{"issue":"2","key":"162_CR75","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1109\/TCT.1963.1082116","volume":"10","author":"DH Younger","year":"1963","unstructured":"Younger, D.H.: Minimum feedback arc sets for a directed graph. IEEE Trans. Circuit Theory 10(2), 238\u2013245 (1963)","journal-title":"IEEE Trans. Circuit Theory"},{"issue":"15","key":"162_CR76","doi-asserted-by":"publisher","first-page":"4220","DOI":"10.1080\/00207543.2011.603371","volume":"50","author":"Z Zhang","year":"2012","unstructured":"Zhang, Z., Murray, C.C.: A corrected formulation for the double row layout problem. Int. J. Prod. Res. 50(15), 4220\u20134223 (2012)","journal-title":"Int. J. Prod. Res."},{"issue":"14","key":"162_CR77","doi-asserted-by":"publisher","first-page":"4272","DOI":"10.1080\/00207543.2016.1142134","volume":"54","author":"X Zuo","year":"2016","unstructured":"Zuo, X., Murray, C., Smith, A.: Sharing clearances to improve machine layout. Int. J. Prod. Res. 54(14), 4272\u20134285 (2016). \n                    https:\/\/doi.org\/10.1080\/00207543.2016.1142134","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"162_CR78","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1109\/TASE.2014.2304471","volume":"11","author":"X Zuo","year":"2014","unstructured":"Zuo, X., Murray, C.C., Smith, A.E.: Solving an extended double row layout problem using multiobjective tabu search and linear programming. IEEE Trans. Autom. Sci. Eng. 11(4), 1122\u20131132 (2014)","journal-title":"IEEE Trans. Autom. Sci. Eng."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00162-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-019-00162-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-019-00162-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T23:15:03Z","timestamp":1589066103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-019-00162-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,11]]},"references-count":78,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["162"],"URL":"https:\/\/doi.org\/10.1007\/s12532-019-00162-6","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,11]]},"assertion":[{"value":"21 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}