TESSA—A new greedy heuristic for facilities layout planning

DOI10.1080/00207549208948132zbMath0775.90147OpenAlexW2054535714MaRDI QIDQ4024623

Sharon G. Boswell

Publication date: 4 February 1993

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549208948132

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

A variational approach for a nonlinear 1-dimensional second gradient continuum damage model ⋮ Location and layout planning. A survey ⋮ Two new heuristic algorithms for the maximal planar layout problem ⋮ Discussion A note on ‘On TESSA’ ⋮ A reply to ‘A note on “On TESSA”’ ⋮ Discussion A note on ‘Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach’ ⋮ Discussion A reply to ‘A note on ”Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach”‘ ⋮ A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ On the worst case performance of TESSA

Cites Work

• Two graph-theoretic procedures for an improved solution to the facilities layout problem
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• A Strategy for Solving the Plant Layout Problem
• Unnamed Item

This page was built for publication: TESSA—A new greedy heuristic for facilities layout planning