This paper examines the application of graph theory (GTH) in facilities design and questions whether existing methodologies can be improved. The paper proposes a new approach which introduces the concept of a maximally weighted planar graph (MWPG), in contrast to the more usual maximally planar weighted graph (MPWG).
FouldsL. R.RobinsonD. F.A strategy for solving the plant layout problem. Opl Res. Q., 1976, 27(4) i, 845–855.
6.
CarrieA. S.MooreJ. M.RoczniakM.SeppänenJ. J.Graph theory and computer aided facilities design. OMEGA, 1978, 6(4), 353–361.
7.
NozariA.EnscoreE.Jr.Computerized facility layout with graph theory. Computers and Ind. Engng, 1981, 5(3), 183–193.
8.
FouldsL. R.RobinsonD. F.Graph theoretic heuristics for the plant layout problem. Int. J. Prod. Res., 1978, 16(1), 27–37.
9.
ChanH. M.MilnerD. A.Direct clustering algorithm for group formation in cellular manufacture. J. Mfg Systems, 1982, 1(1), 65–75.
10.
EadesP.FouldsL. R.GiffinJ.An efficient heuristic for identifying a maximum weight planar subgraph. In Combinatorial Mathematics, Vol. IX, Lecture Notes in Mathematics 952, 1982 (Springer-Verlag, Berlin).
11.
Al-HakimL. A.Two graph-theoretic procedures for an improved solution to the facilities layout problem. Int. J. Prod. Res., 1991, 29(8), 1701–1718.
12.
LeungJ.A new graph-theoretic heuristic for facility layout. Managmt Sci., 1992, 38(4), 594–605.
13.
BoswellS. G.TESSA–A new greedy heuristic for facilities layout planning. Int. J. Prod. Res., 1992, 30(8), 1957–1968.
14.
MooreJ. M.The zone of compromise for evaluating lay-out arrangements. Int. J. Prod. Res., 1980, 18(1), 1–10.
15.
BalasubramanianK. N.PanneerselvamR.Covering technique-based algorithm for machine grouping to form manufacturing cells. Int. J. Prod. Res., 1993, 31(6), 1479–1504.
