Abstract
We consider the single-product facility layout problem with machine capacities (and hence multiple machines of each type) and random demand. We develop a very efficient heuristic allowing us to find good solutions to the stochastic case whenever good solutions can be found for the corresponding deterministic problem with uncapacitated machines of the same dimension. Hence, this problem represents a case where a specific deterministic model, even when solved heuristically, produces a very good solution to a stochastic model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balakrishnan J, Cheng CH, Wong KF (2003) FACOPT: a user friendly facility layout optimization system. Comput Oper Res 30(11):1625–1641
Baykasoglu A, Cindy NNZ (2001) A simulated annealing algorithm for dynamic plant layout problem. Comput Oper Res 28(14):1403–1426
Benjaafar S, Sheikhzadeh M (2000) Design of flexible plant layouts. IIE Trans 32(4):309–322
Bukard RE, Bonniger T (1983) A heuristic for quadratic boolean programs with applications to quadratic assignemtn problems. Eur J Oper Res 13(4):347–386
Chiang W, Chiang C (1998) Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation. Eur J Oper Res 106(2–3):457–488
Francis RL, White JA (1974) Facility layout and location: an analytical approach. Prentice Hall, Englewood Cliffs
Helm SA, Hadley SW (2000) Tabu search based heuristics for multi floor facility layout. Int J Prod Res 38(2):365–383
Heragu SS, Alfa AS (2003) Experimental analysis of simulated annealing based algorithms for the layout problem. Eur J Oper Res 57(2):190–202
Heragu SS, Kusiak A (1988) Machine layout problem in flexible manufacturing systems. Oper Res 36(2):258–268
Koopmans TC, Beckman M (1957) Assignment problems and the location of economic activities. Econometrica 25(1):53–76
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(1):117–138
Lium AG, Crainic TG, Wallace SW (2009) A study of demand stochasticity in stochastic network design. Transp Sci 43(2):144–157
Misevicius A (2003) A modified simulated annealing algorithm for quadratic assignment problem. Informatica 14(4):497–514
Salimanpur M, Jafari A (2008) Optimal solution for the two-dimensional facility layout problem using a branch-and-bound algorithm. Comput Ind Eng 55(3):609–619
Singh SP, Sharma RRK (2006) A review of different approaches to the facility layout problems. Int J Adv Manuf Technol 30(5–6):425–433
Singh SP, Singh VK (2010) An improved heuristic approach for multi-objective facility layout problem. Int J Prod Res 48(4):1171–1194
Suzaki K (1985) Japanese manufacturing techniques: their importance to U.S. manufacturers. J Bus Strategy 5(3):10–19
Taghavi A, Murat A (2011) A heuristic procedure for the integrated facility layout design and flow assignment problem. Comput Ind Eng 61(1):55–63
Tavakkoli-Moghaddain R, Shanyan E (1998) Facilities layout design by genetic algorithms. Comput Ind Eng 35(3):527–530
Thapalia BK, Crainic TG, Kaut M, Wallace SW (2012) Single source single-commodity stochastic network design. Comput Manag Sci 9(1):139–160
Tomkins JA, Bozer YA, Frazelle EH, Tanchoco JMA, Trevino J (2003) Facil Plan. Wiley, New York
Urban TL, Chiang W, Russell RA (2000) The integrated machine allocation and layout problem. Int J Prod Res 38(12):2911–2930
Acknowledgments
We would like to thank one referee and an associate editor for very useful comments on this paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhao, Y., Wallace, S.W. A heuristic for the single-product capacitated facility layout problem with random demand. EURO J Transp Logist 4, 379–398 (2015). https://doi.org/10.1007/s13676-014-0052-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13676-014-0052-6