Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty

References

• Abdinnour-Helm S, Hadley SW (2000) Tabu search based heuristics for multi-floor facility layout. Internat. J. Production Res. 38:365–383.Crossref, Google Scholar
• Balakrishnan J, Cheng CH, Wong KF (2003) FACOPT: A user friendly facility layout optimization system. Comput. Oper. Res. 30:1625–1641.Crossref, Google Scholar
• Baykasoglu A, Cindy NNZ (2001) A simulated annealing algorithm for dynamic plant layout problem. Comput. Oper. Res. 28:1403–1426.Crossref, Google Scholar
• Benjaafar S, Sheikhzadeh M (2000) Design of flexible plant layouts. IIE Trans. 32:309–322.Crossref, Google Scholar
• Bukard RE, Bonniger T (1983) A heuristic for quadratic Boolean programs with applications to quadratic assignment problems. Eur. J. Oper. Res. 13:347–386.Google Scholar
• Chiang W, Chiang C (1998) Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem fromulation. Eur. J. Oper. Res. 106:457–488.Crossref, Google Scholar
• Cooper L (1963) Location-allocation problems. Oper. Res. 11:331–343.Link, Google Scholar
• Francis RL, White JA (1974) Facility Layout and Location: An Analytical Approach (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
• Heragu SS, Alfa AS (2003) Experimental analysis of simulated annealing based algorithms for the layout problem. Eur. J. Oper. Res. 57:190–202.Crossref, Google Scholar
• Heragu SS, Kusiak A (1988) Machine layout problem in flexible manufacturing systems. Oper. Res. 36:258–268.Link, Google Scholar
• Koopmans TC, Beckman M (1957) Assignment problems and the location of economic activities. Econometrica 25:53–76.Crossref, Google Scholar
• Lee KY, Han SN, Roh M (2003) An improved genetic algorithm for facility layout problems having inner structure walls and passage. Comput. Oper. Res. 30:117–138.Crossref, Google Scholar
• Lium A-G, Crainic TG, Wallace SW (2009) A study of demand stochasticity in service network design. Transportation Sci. 43:144–157.Link, Google Scholar
• Misevicius A (2003) A modified simulated annealing algorithm for quadratic assignment problem. Informatica 14:497–514.Crossref, Google Scholar
• Salimanpur M, Jafari A (2008) Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithm. Comput. Indust. Engrg. 55:609–619.Google Scholar
• Singh SP, Sharma RRK (2006) A review of different approaches to the facility layout problems. Internat. J. Advanced Manufacturing Tech. 30:425–433.Crossref, Google Scholar
• Singh SP, Singh VK (2010) An improved heuristic approach for multi-objective facility layout problem. Internat. J. Production Res. 48:1171–1194.Crossref, Google Scholar
• Taghavi A, Murat A (2011) A heuristic procedure for the integrated facility layout design and flow assignment problem. Comput. Indust. Engrg. 61:55–63.Crossref, Google Scholar
• Tavakkoli-Moghaddain R, Shanyan E (1998) Facilities layout design by genetic algorithms. Comput. Indust. Engrg. 35:527–530.Crossref, Google Scholar
• Tomkins JA, Bozer YA, Frazelle EH, Tanchoco JMA, Trevino J (2003) Facility Planning (John Wiley & Sons, New York).Google Scholar
• Urban TL, Chiang W, Russell RA (2000) The integrated machine allocation and layout problem. Internat. J. Production Res. 38:2911–2930.Crossref, Google Scholar
• Wallace SW (2000) Decision making under uncertainty: Is sensitivity analysis of any use? Oper. Res. 48:20–25.Link, Google Scholar
• Zhang H, Royo C, Constatino M (2010) Effective formulation reductions for the quadratic assignment problem. Comput. Oper. Res. 37:2007–2016.Crossref, Google Scholar
• Zhao Y, Wallace SW (2014) A heuristic for the single-product capacitated facility layout problem with random demand. EURO J. Transportation Logistics. Forthcoming.Google Scholar