A distance assignment approach to the facility layout problem

European Journal of Operational Research

Volumn 57, Issue 2, 1992, Pages 253-270

  Rosenblatt, Meir J ^a,b   Golany, Boaz ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Facility layout; heuristic algorithms; networks; quadratic assignment problems

Indexed keywords

MATHEMATICAL TECHNIQUES - ALGORITHMS; OPERATIONS RESEARCH;

DISTANCE ASSIGNMENT; HEURISTIC ALGORITHM; NETWORK FORMULATION; QUADRATIC ASSIGNMENT;

INDUSTRIAL PLANTS;

EID: 0026830446     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(92)90047-D     Document Type: Article

References (39)

1. A tight linearization and an algorithm for zero-one quadratic programming problems
2. A heuristic algorithm and simulation approach to the relative location of facilities
3. Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
4. An integer programming approach to a class of combinatorial problems
5. Quadratic assignment problems
6. Numerical investigations on quadratic assignment problem
7. DISCON: A new method for the layout problem
8. A heuristic procedure for the layout of a large number of facilities
9. Multiple criteria approach to the facilities layout problem
10. Techniques for facilities layout: Deciding which pairs of activities should be adjacent
11. The optimal assignment of facilities to locations by branch and bound
12. Optimal and suboptimal algorithms for the quadratic assignment problem
13. An N-step, 2-variable search algorithm for the component placement problem
14. Machine layout problem in flexible manufacturing systems
15. Quantitative tools for plant layout analysis
16. Quadratic assignment problem algorithms and the location of indivisible facilities
17. An algorithm for the quadratic assignment problem using Benders' decomposition
18. Assignment problems and the location of economic activities
19. The quadratic assignment problem
20. CORELAP — Computerized relationship layout planning
21. Utilizing cut trees as design skeletons for facility layout
22. Matching based interactive facility layout
23. Computer program evaluates plant layout alternatives
24. An experimental comparison of techniques for the assignment of facilities to locations
25. Tree-search algorithms for quadratic assignment problems
26. The facilities layout problem: A multi-goal approach
27. The dynamics of plant layout
28. The single period stochastic plant layout problem
29. A robustness approach to facilities layout
30. A discrete efficient frontier approach to the plant layout problem
31. A cluster analysis approach to facility layout
32. Automated layout design program
33. A multiple criteria model for the facilities layout problem
34. A computerized method for office layout
35. Solving quadratic assignment problems by ‘simulated annealing’