A branch and bound algorithm for locating input and output points of departments on the block layout

Journal of the Operational Research Society

Volumn 50, Issue 5, 1999, Pages 517-525

  Kim, J G ^a   Kim, Y D ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Branch and bound algorithm; Facility layout; Input and output points

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; PROCESS ENGINEERING;

BRANCH AND BOUND ALGORITHMS;

PLANT LAYOUT;

EID: 0032653781     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600720     Document Type: Article

References (14)

1. Montreuil B (1987). Integrating design of cell layout, input/output I/O point configuration, and flow network of manufacturing systems. In: Liu CR, Requicha A and Chandra- sekar S (eds). Intelligent and Integrated Manufacturing Analysis and Synthesis 1987. ASME: New York, pp 315-326.
2. Meller RD and Gau K-Y (1996). The facility layout problem: recent and emerging trends and perspectives. J Manufact Sys 15: 351-366.
3. Tate DM and Smith EA (1995). Unequal-area facility by genetic search. IIE Trans 27: 465-472.
4. Kim J-G and Kim Y-D (1998). A Space partitioning method for facility layout problems with shape constraints. IIE Trans 30: 947-957.
5. Montreuil B and Ratliff HD (1988). Optimizing the location of input/output stations within facilities layout. Engng Costs and Prod Econ 14: 177-187.
6. Picard JC and Ratliff HD (1978). A cut approach to the rectilinear distance facility location problem. Opns Res 26: 422-433.
7. Sinriech D and Tanchoco JMA (1992). The centroid projection method for locating pick-up and delivery I/O points in singleloop AGV systems. J Manufact Sys 11: 297-307.
8. Kim J and Klein CM (1996). Location of departmental pickup and delivery points for an AGV system. Int J Prod Res 34: 407-420.
9. Benson B and Foote BL (1997). DoorFAST: A constructive procedure to optimally layout a facility including aisles and door locations based on an aisle flow distance metric. Int J Prod Res 35: 1825-1842.
10. Drezner Z (1987). A heuristic procedure for the layout of a large number of facilities. Mgmt Sci 33: 907-915.
11. Montreuil B and Venkatadri U (1991). Strategic interpolative design of dynamic manufacturing sustems layouts. Mgmt Sci 37: 682-694.
12. Montreuil B and Laforge A (1992). Dynamic layout design given a scenario tree of probable futures. Eur J Opl Res 63: 271-286.
13. Banner'ee P and Zhou Y (1995). Facilities layout design optimization with single LOOP material flow path configuration. Int J Prod Res 33: 183-203.
14. Cabot AV, Francis RL and Stary MA (1970). A network flow solution to a rectilinear distance facility location problem. AIIE Trans 2: 132-141.