38
Views
20
CrossRef citations to date
0
Altmetric
Original Articles

TESSA—A new greedy heuristic for facilities layout planning

Pages 1957-1968 | Received 01 Nov 1991, Published online: 07 May 2007

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

Read on this site (6)

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
K. H. WATSON & J. W. GIFFIN. (1996) On the worst case performance of TESSA. International Journal of Production Research 34:10, pages 2963-2966.
Read now
M. M. D. HASSAN. (1994) Discussion A note on ‘Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach’. International Journal of Production Research 32:1, pages 231-234.
Read now
S. G. BOSWELL. (1994) A reply to ‘A note on “On TESSA”’. International Journal of Production Research 32:1, pages 227-230.
Read now
L. A. AL-HAKIM. (1994) Discussion A note on ‘On TESSA’. International Journal of Production Research 32:1, pages 223-225.
Read now

Articles from other publishers (14)

Sherif Abdelmohsen, Ayman Assem, Sherif Tarabishy & Ahmed Ibrahim. 2017. Design Computing and Cognition '16. Design Computing and Cognition '16 459 475 .
Ipek Gürsel Dino. (2016) An evolutionary approach for 3D architectural space layout design exploration. Automation in Construction 69, pages 131-150.
Crossref
Ali Shoja Sangchooli & Mohammad Reza Akbari Jokar. (2013) Obtaining an Initial Solution for Facility Layout Problem. Journal of Industrial Mathematics 2013, pages 1-10.
Crossref
Mohammad Reza Akbari Jokar & Ali Shoja Sangchooli. (2010) Constructing a block layout by face area. The International Journal of Advanced Manufacturing Technology 54:5-8, pages 801-809.
Crossref
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
S. P. Singh & R. R. K. Sharma. (2005) A review of different approaches to the facility layout problems. The International Journal of Advanced Manufacturing Technology 30:5-6, pages 425-433.
Crossref
Nathalie Marcoux, Diane Riopel & André Langevin. 2005. Logistics Systems: Design and Optimization. Logistics Systems: Design and Optimization 123 170 .
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
L. R. Foulds & Horst W. Hamacher. 2001. Encyclopedia of Optimization. Encyclopedia of Optimization 605 609 .
Wolfgang Domschke & Gabriela Krispin. (1997) Location and layout planning. OR Spektrum 19:3, pages 181-194.
Crossref
Jürgen Merker & Gerhard Wäscher. (1997) Two new heuristic algorithms for the maximal planar layout problem. OR Spektrum 19:2, pages 131-137.
Crossref
Russell D. Meller & Kai-Yin Gau. (1996) The facility layout problem: Recent and emerging trends and perspectives. Journal of Manufacturing Systems 15:5, pages 351-366.
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

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.