On the worst case performance of TESSA

TESSA is a facility layout heuristic for obtaining a maximal planar adjacency graph from relationship chart data. Computational experiments performed by Boswell have shown that the algorithm produces good quality solutions, almost all of which are above 90% of the often unattainable upper bound. In this paper the authors show that the heuristic displays arbitrarily bad theoretical worst case performance.