Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Branch and Bound Algorithm for the Facility Layout Problem Without Shape Distortion

  • Kim, Chae-Bogk (department of Technology Education, Korea National University) ;
  • Kim, Yung-Sik (Department of Computer Education, Korea National University) ;
  • Lee, Dong-Hoon (Department of Computer Science Korea university)
  • Published : 1996.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

Given the flow matrix, plant size (rectangle shape) and department sizes, the algorithm in this paper provides the plant layout with rectilinear distance measure. To construct automated facility design, eigenvector approach is employed. A branch and bound computer code developed by Tillinghast is modified to find the feasible fits of departments without shape distortion (see [1])in the plant rectangle. The computational results compared with CRAFT are shown.

Keywords

References

  1. management Science v.40 no.7 An improvement type layout algorithm for single and multiple floor facilities Bozer,Y.A.;R.D.Meller;S.J.Erlebacher
  2. Harvard Business Review v.42 no.2 Allocating facilities with CRAFT Buffa,E.S.;G.C.Armour;T.E.Vollman
  3. Management Science v.33 no.7 A heuristic procedure for the layout of a large number of facilities Drezner,Zvi
  4. Facility layout and location Francis,R.L.;L.F.McGinnis;J.A.White
  5. Ph. D Dissertation, University of Oklahoma Algorithms for automated three dimensional facility layout problems Kim,Chae-Bogk
  6. International Journal of Production Research v.29 no.4 A fuzzy approach to facilities layout planning Raoot,A.D.;Atanu Rakdhit
  7. Master Thesis, University of Oklahoma Automated facility layout design : Computational efficiency of a branch and bound approach for square departments of unequal size Tillinghast,D.T.