References
- Abdinnour-Helm, S., and S. W. Hadley. 2000. “Tabu Search Based Heuristics for Multi Floor Facility Layout.” International Journal of Production Research 38 (2): 365–383.
- Baykasoglu, A., and N. N. Z. Cindy. 2001. “A Simulated Annealing Algorithm for Dynamic Plant Layout Problem.” Computers and Operations Research 28 (14): 1403–1426.
- Benjaafar, S., and M. Sheikhzadeh. 2000. “Design of Flexible Plant Layouts.” IIE Transactions 32 (4): 309–322.
- Bukard, R. E., and T. Bonniger. 1983. “A Heuristic for Quadratic Boolean Programs with Applications to Quadratic Assignment Problems.” European Journal of Operational Research 13 (4): 347–386.
- Chiang, W., and C. Chiang. 1998. “Intelligent Local Search Strategies for Solving Facility Layout Problems with the Quadratic Assignment Problem Fromulation.” European Journal of Operational Research 106 (2–3): 457–488.
- Coit, D. W., and A. E. Smith. 1996. “Penalty Guided Genetic Search for Reliability Design Optimization.” Computers and Industrial Engineering 30 (4): 895–904.
- Cooper, L. 1963. “Location-allocation Problems.” Operations Research 11 (3): 331–343.
- Heragu, S. S., and A. S. Alfa. 2003. “Experimental Analysis of Simulated Annealing Based Algorithms for the Layout Problem.” European Journal of Operational Research 57 (2): 190–202.
- Irani, S. A., and H. Huang. 2006. “Cascading Flowlines and Layout Modules: Practical Strategies for Machine Duplication in Facility Layout.” International Journal of Flexible Manufacturing Systems 17: 119–149.
- Keefer, D. L. 1994. “Certainty Equivalents for Three-point Discrete-distribution Approximations.” Management Science 40: 760–773.
- King, Alan J., and Stein W. Wallace. 2012. Modeling with Stochastic Programming. New York: Springer Series in Operations Research and Financial Engineering, Springer.
- Koopmans, T. C., and M. Beckman. 1957. “Assignment Problems and the Location of Economic Activities.” Econometrica 25 (1): 53–76.
- Kouvelis, P., A. A. Kurawarwala, and G. J. Gutierrez. 1992. “Algorithms for Robust Single and Multiple Period Layout Planning for Manufacturing System.” European Journal of Operational Research 63 (2): 287–303.
- Kulturel-Konak, S., A. E. Smith, and B. A. Norman. 2004. “Layout Optimization Considering Production Uncertainty and Route Flexibility.” International Journal of Production Research 42 (21): 4475–4493.
- Misevicius, A. 2003. “A Modified Simulated Annealing Algorithm for Quadratic Assignment Problem.” Informatica 14 (4): 497–514.
- Rosenblatt, M. J. 1986. “The Dynamics of Plant Layout.” Management Science 32 (1): 76–86.
- Rosenblatt, M. J., and D. H. Kropp. 1992. “The Single Period Stochastic Plant Layout Problem.” IIE Transactions 24 (2): 169–176.
- Rosenblatt, M. J., and H. L. Lee. 1987. “A Robustness Approach for Facility Design.” International Journal of Production Research 25 (4): 479–486.
- Salimanpur, M., and A. Jafari. 2008. “Optimal Solution for the Two-dimensional Facility Layout Problem Using a Branch-and-bound Algorithm.” Computers and Industrial Engineering 55 (3): 609–619.
- Sethi, A. K., and S. P. Sethi. 1990. “Flexibility in Manufacturing: A Survey.” The International Journal of Flexible Manufacturing Systems 2: 289–328.
- Singh, S. P., and V. K. Singh. 2010. “An Improved Heuristic Approach for Multi-objective Facility Layout Problem.” International Journal of Production Research 48 (4): 1171–1194.
- Slack, N., S. Chambers, and R. Johnston. 2007. Operations Management. Harlow: Pearson Education Limited.
- Tomkins, J. A., Y. A. Bozer, E. H. Frazelle, J. M. A. Tanchoco, and J. Trevino. 2003. Facility Planning. New York: John Wiley and Sons.
- Urban, T. L. 1992. “Computational Performance and Efficiency of Lower-bound Procedures for the Dynamic Facility Layout Problem.” European Journal of Operational Research 57 (2): 271–279.
- Viswanadham, N., and Y. Narahari. 1992. Performance Modeling of Automated Manufacturing Systems. Englewood Cliffs, NJ: Prentice Hall.
- Zhao, Y., and S. W. Wallace. 2014. “Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty.” INFORMS Journal on Computing 26 (4): 798–808.