2
Views
36
CrossRef citations to date
0
Altmetric
Theoretical Paper

A Strategy for Solving the Plant Layout Problem

&
Pages 845-855 | Published online: 19 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (6)

Amir Ahmadi-Javid, Amir Ardestani-Jaafari, Leslie R Foulds, Hossein Hojabri & Reza Zanjirani Farahani. (2015) An algorithm and upper bounds for the weighted maximal planar graph problem. Journal of the Operational Research Society 66:8, pages 1399-1412.
Read now
Ying-Chin Ho & Ta-Wei Liao. (2012) The layout design of semiconductor bays with spine and perimeter inter-bay guide path loops. International Journal of Production Research 50:3, pages 719-741.
Read now
Chien-Wen Chen & D.Y. Sha. (2001) A LITERATURE REVIEW AND ANALYSIS TO THE FACILITY LAYOUT PROBLEM. Journal of the Chinese Institute of Industrial Engineers 18:1, pages 55-73.
Read now
G. SURESH, V. V. VINOD & S. SAHU. (1995) A genetic algorithm for facility layout. International Journal of Production Research 33:12, pages 3411-3423.
Read now
SHARONG. BOSWELL. (1992) TESSA—A new greedy heuristic for facilities layout planning. International Journal of Production Research 30:8, pages 1957-1968.
Read now
L. R. FOULDS & D. F. ROBINSON. (1978) Graph theoretic heuristics for the plant layout problem. International Journal of Production Research 16:1, pages 27-37.
Read now

Articles from other publishers (30)

Markus Chimani, Ivo Hedtke & Tilo Wiedera. (2019) Exact Algorithms for the Maximum Planar Subgraph Problem. ACM Journal of Experimental Algorithmics 24, pages 1-21.
Crossref
Hossein Hojabri & Elnaz Miandoabchi. 2013. Graph Theory for Operations Research and Management. Graph Theory for Operations Research and Management 212 223 .
R. M. A. Silva, M. G. C. Resende, P. M. Pardalos, G. R. Mateus & G. De Tomi. 2013. Models, Algorithms, and Technologies for Network Analysis. Models, Algorithms, and Technologies for Network Analysis 175 190 .
Illya V. Hicks. (2007) New facets for the planar subgraph polytope. Networks 51:2, pages 120-132.
Crossref
Mauricio G.C. Resende & Celso C. Ribeiro. 2009. Encyclopedia of Optimization. Encyclopedia of Optimization 1448 1453 .
L. R. Foulds & Horst W. Hamacher. 2009. Encyclopedia of Optimization. Encyclopedia of Optimization 975 979 .
Ibrahim H. Osman. (2006) A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem. Computers & Operations Research 33:9, pages 2526-2546.
Crossref
Bryan A. Norman & Alice E. Smith. (2006) A continuous approach to considering uncertainty in facility design. Computers & Operations Research 33:6, pages 1760-1775.
Crossref
Ibrahim H. Osman, Baydaa Al-Ayoubi & Musbah Barake. (2003) A greedy random adaptive search procedure for the weighted maximal planar graph problem. Computers & Industrial Engineering 45:4, pages 635-651.
Crossref
Alice E. Smith & Bryan A. Norman. 2003. Evolutionary Optimization. Evolutionary Optimization 309 327 .
Mauricio G. C. Resende & Celso C. Ribeiro. 2001. Encyclopedia of Optimization. Encyclopedia of Optimization 908 913 .
L. R. Foulds & Horst W. Hamacher. 2001. Encyclopedia of Optimization. Encyclopedia of Optimization 605 609 .
Alice E. Smith & Bryan A. Norman. 2000. Evolutionary Design and Manufacture. Evolutionary Design and Manufacture 175 186 .
Robert Cimikowski & Edward Mooney. (1997) Proximity-based adjacency determination for facility layout. Computers & Industrial Engineering 32:2, pages 341-349.
Crossref
M. Jünger & P. Mutzel. (1996) Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16:1, pages 33-59.
Crossref
Robert Cimikowski & Edward Mooney. (1995) Heuristics for a new model of facility layout. Computers & Industrial Engineering 29:1-4, pages 273-277.
Crossref
J.-Y. Kim & Y.-D. Kim. (1995) Graph theoretic heuristics for unequal-sized facility layout problems. Omega 23:4, pages 391-401.
Crossref
Wu-Ji Li & J. MacGregor Smith. (1995) An algorithm for Quadratic Assignment Problems. European Journal of Operational Research 81:1, pages 205-216.
Crossref
M. Hasan & I.H. Osman. (2006) Local Search Algorithms for the Maximal Planar Layout Problem. International Transactions in Operational Research 2:1, pages 89-106.
Crossref
Marc Goetschalckx. (1992) An interactive layout heuristic based on hexagonal adjacency graphs. European Journal of Operational Research 63:2, pages 304-321.
Crossref
Paul D. Dowling & R. F. Love. (1990) Floor layouts using a multifacility location model. Naval Research Logistics 37:6, pages 945-952.
Crossref
Sunderesh Heragu. (1990) Modeling the machine layout problem. Computers & Industrial Engineering 19:1-4, pages 294-298.
Crossref
L. R. FOULDS & J. W. GIFFIN. (2006) Some Graph‐Theoretic Approaches to Certain Facilities Layout Models a . Annals of the New York Academy of Sciences 576:1, pages 178-191.
Crossref
Bay Arinze, Snehamay Banerjee & Cheickna Sylla. (1989) A methodology for knowledge based decision support for facilities layout planning. Computers & Industrial Engineering 17:1-4, pages 31-36.
Crossref
SD Deshpande, S Krishnamoorthy & VB Deshpande. (1988) Computer-aided site layout for construction projects—A graph theoretic approach. Omega 16:6, pages 612-615.
Crossref
Andrew Kusiak & Sunderesh S. Heragu. (1987) The facility layout problem. European Journal of Operational Research 29:3, pages 229-251.
Crossref
Mohsen MD Hassan & Gary L Hogg. (1987) A review of graph theory application to the facilities layout problem. Omega 15:4, pages 291-300.
Crossref
Rh Green & Lar Al-Hakim. (1985) A heuristic for facilities layout planning. Omega 13:5, pages 469-474.
Crossref
Peter Eades, L. Foulds & J. Giffin. 1982. Combinatorial Mathematics IX. Combinatorial Mathematics IX 239 251 .
Ardavan Nozari & E.Emory EnscoreJr.Jr.. (1981) Computerized facility layout with graph theory. Computers & Industrial Engineering 5:3, pages 183-193.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.