TESSA - A NEW GREEDY HEURISTIC FOR FACILITIES LAYOUT PLANNING

被引:21
作者
BOSWELL, SG
机构
[1] Department of Mathematics, University of Newcastle, NSW
关键词
D O I
10.1080/00207549208948132
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
TESSA is a heuristic for determining which facilities should be adjacent in a planar layout. Once the adjacencies are known the block plan can be constructed by existing techniques. TESSA overcomes problems with earlier heuristics for determining adjacencies as it does not require planarity testing nor does it restrict the type of layout produced. The algorithm is polynomial in time and produces good quality solutions, almost all of which are above 90% of the (often unattainable) upper bound.
引用
收藏
页码:1957 / 1968
页数:12
相关论文
共 11 条
[1]  
Al-Hakim L.A., Two graph-theoretic procedures for an improved solution to the facilities layout problem, International Journal of Production Research, 29, pp. 1701-1718, (1991)
[2]  
Boswiill S.G., Bounds on the number of T-operation edge substitutions required to transform a maximal planar graph into another, Australasian Journal of Combinatorics, 4, pp. 5-24, (1991)
[3]  
Foulds L.R., Gibbons P.B., Giffin J.W., Facilities layout adjacency determination: An experimental comparison of three graph theoretic heuristics, Operations Research, 33, pp. 1091-1106, (1985)
[4]  
Foulds L.R., Robinson D.F., A strategy for solving the plant layout problem, Operational Research Quarterly, 27, pp. 845-855, (1976)
[5]  
Foulds L.R., Robinson D.F., Graph theoretic heuristics for the plant layout problem, International Journal of Production Research, 16, pp. 27-37, (1978)
[6]  
Giffin J.W., Graph Theoretic Techniques for Facilities Layout, (1984)
[7]  
Giffin J.W., Rinsma I., An Improved Approach to Adjacency Graph Dualization, (1991)
[8]  
Graver J.E., Watkins M.E., Combinatorics with Emphasis on the Theory of Graphs, (1977)
[9]  
Green R.H., Al-Hakim L., A heuristic for facilities layout planning, OMEGA International Journal of Management Science, 13, pp. 469-474, (1985)
[10]  
Harary F., Graph Theory, (1969)