Bi-objective facility expansion and relayout considering monuments

IIE Transactions (Institute of Industrial Engineers)

Volumn 39, Issue 7, 2007, Pages 747-761

  Kulturel Konak, Sadan ^a   Smith, Alice E ^b   Norman, Bryan A ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b AUBURN UNIVERSITY   (United States)

^c University of Pittsburgh   (United States)

Author keywords

Bi objective unequal area facility re layout problem; Facility expansion; Fixed departments; Monuments; Pareto front; Tabu search

Indexed keywords

HEURISTIC METHODS; OPERATING COSTS; PARETO PRINCIPLE; PLANT LAYOUT; TABU SEARCH;

BI-OBJECTIVE UNEQUAL-AREA FACILITY RE-LAYOUT PROBLEM; FACITY EXPANSION; FIXED DEPARTMENTS;

PLANT EXPANSION;

EID: 34248207179     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170600805943     Document Type: Article

References (41)

1. Armour, G. C. and Buffa, E. S. (1963) A heuristic algorithm and simulation approach to relative location of facilities. Management Science, 9:2, pp. 294-309.
2. Balakrishnan, J. and Cheng, C. H. (1998) Dynamic layout algorithms: A state-of-the-art survey. International Journal of Management Science, 26:4, pp. 507-521.
3. Balakrishnan, J. and Cheng, C. H. (2000) Genetic search and the dynamic layout problem. Computers &Operations Research, 27:6, pp. 587-593.
4. Balakrishnan, J., Cheng, C. H. and Conway, D. G. (2000) An improved pair-wise exchange heuristic for the dynamic plant layout problem. International Journal of Production Research, 38:12, pp. 3067-3077.
5. Balakrishnan, J., Jacobs, F. R. and Venkataramanan, M. A. (1992) Solutions for the constrained dynamic facility layout problem. European Journal of Operational Research, 57, pp. 280-286.
6. Baykasoglu, A. and Gindy, N. (2001) A simulated annealing algorithm for dynamic layout problem. Computers &Operations Research, 28:14, pp. 1403-1426.
7. Bazaraa, M. S. (1975) Computerized layout design: A branch and bound approach. AIIE Transactions, 7:4, pp. 432-438.
8. Bozer, Y. A., Meller, R. D. and Erlebacher, S. J. (1994) An improvement-type layout algorithm for single and multiple floor facilities. Management Science, 40:7, pp. 918-932.
9. Chen, S.-J., Hwang, C.-L. and Hwang, F. P. (1992) Fuzzy Multiple Attribute Decision Making, Springer-Verlag, Berlin, Germany
10. Chiang, W.-C. (2001) Visual facility layout design system. International Journal of Production Research, 39:9, pp. 1811-1836.
11. Coello, C. A.C. (2000) Handling preferences in evolutionary multiobjective optimization: A survey. Proceedings of the Congress on Evolutionary Computation IEEE Service Center, pp. 30-37. IEEE Service Center, Piscataway, NJ
12. Coit, D. W., Smith, A. E. and Tate, D. M. (1996) Adaptive penalty methods for genetic optimization of constrained combinatorial problems. INFORMS Journal on Computing, 8, pp. 173-182.
13. Conway, D. G. and Venkataramanan, M. A. (1994) Genetic search and the dynamic facility layout problem. Computers &Operations Research, 21:8, pp. 955-960.
14. Cvetkovic, D. and Parmee, I. C. (2002) Preferences and their application in evolutionary multiobjective optimization. IEEE Transactions on Evolutionary Computation, 6:1, pp. 42-57.
15. Glover, F. (1989) Tabu search part I. ORSA Journal on Computing, 1, pp. 190-206.
16. Glover, F. (1990) Tabu search-part II. ORSA Journal on Computing, 2, pp. 4-32.
17. Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer, Boston, MA
18. Glover, F., Taillard, E. and de Werra, D. (1993) A user's guide to tabu search. Annals of Operations Research, 41, pp. 3-28.
19. Horn, J. (1997) Multi-criterion decision making. Handbook of Evolutionary Computation, pp. F1.9:1-F1.9:15. IOP Publishing Ltd. and Oxford University Press
20. Kaku, B. K. and Mazzola, J. B. (1997) A tabu search heuristic for the dynamic plant layout problem. INFORMS Journal on Computing, 9:4, pp. 374-383.
21. Keeney, R. L. and Raiffa, H. (1993) Decisions with Multiple Objectives: Preferences and Value Tradeoffs, Cambridge University Press, Cambridge, UK
22. Kochhar, J. S. and Heragu, S. S. (1999) Facility layout design in a changing environment. International Journal of Production Research, 37:10, pp. 2429-2446.
23. Kouvelis, P., Kuawarwala, A. A. and Gutierrez, G. J. (1992) Algorithms for robust single and multiple period layout planning for manufacturing systems. European Journal of Operational Research, 63, pp. 287-303.
24. Kulturel-Konak, S., Norman, B. A., Coit, D. W. and Smith, A. E. (2004) Exploiting tabu search memory in constrained problems. INFORMS Journal on Computing, 14:3, pp. 241-254.
25. Kulturel-Konak, S., Smith, A. E. and Norman, B. A. (2006) Multi-objective tabu search using a multinomial probability mass function. European Journal of Operational Research, 169:3, pp. 915-931.
26. Lacksonen, T. A. (1994) Static and dynamic layout problems with varying areas. Journal of the Operational Research Society, 45:1, pp. 59-69.
27. Lacksonen, T. A. and Enscore, E. E. (1993) Quadratic assignment algorithms for the dynamic layout problem. International Journal of Production Research, 31:3, pp. 503-517.
28. Meller, R. D. (1997) The multi-bay manufacturing facility layout problem. International Journal of Production Research, 35:5, pp. 1229-1237.
29. Meller, R. D. and Bozer, Y. A. (1997) Alternative approaches to solve the multi-floor facility layout problem. Journal of Manufacturing Systems, 16:3, pp. 192-203.
30. Meller, R. D. and Gau, K.-Y. (1996) Facility layout objective functions and robust layouts. International Journal of Production Research, 34:9, pp. 2727-2742.
31. Montreuil, B. and Laforge, A. (1992) Dynamic layout design given a scenario tree of probable futures. European Journal of Operational Research, 63, pp. 271-286.
32. Montreuil, B. and Venkatadri, U. (1991) Strategic interpolative design of dynamic manufacturing systems layouts. Management Science, 37:6, pp. 682-694.
33. Rosenblatt, M. J. (1986) The dynamics of plant layout. Management Science, 32:1, pp. 76-86.
34. Rosenblatt, M. J. and Sinuany-Stern, Z. (1986) A discrete efficient frontier approach to the plant layout problem. Material Flow, 3, pp. 277-281.
35. Smith, A. E. and Tate, D. M. (1993) Genetic optimization using a penalty function. Proceedings of the 5th International Conference on Genetic Algorithms Morgan Kaufmann, pp. 499-505. Morgan Kaufmann, San Mateo, CA
36. Tate, D. M. and Smith, A. E. (1995) Unequal area facility layout using genetic search. IIE Transactions, 27, pp. 465-472.
37. Urban, T. L. (1992) Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem. European Journal of Operational Research, 57, pp. 271-279.
38. Urban, T. L. (1993) A heuristic for the dynamic facility layout problem. IIE Transactions, 25:4, pp. 57-63.
39. Urban, T. L. (1998) Solution procedures for the dynamic facility layout problem. Annals of Operations Research, 76, pp. 323-342.
40. Van Camp, D. J., Carter, M. V. and Vanelli, A. (1991) A nonlinear optimization approach for solving facility layout problems. European Journal of Operational Research, 57, pp. 174-189.
41. Yang, T. and Peters, B. A. (1998) Flexible machine layout design for dynamic and uncertain production environments. European Journal of Operational Research, 108, pp. 49-64.