Branch and bound algorithm for the facility layout problem without shape distortion

Branch and bound algorithm for the facility layout problem without shape distortion

0.00 Avg rating0 Votes
Article ID: iaor19971735
Country: South Korea
Volume: 21
Issue: 2
Start Page Number: 59
End Page Number: 70
Publication Date: Aug 1996
Journal: Journal of the Korean ORMS Society
Authors: , ,
Keywords: layout
Abstract:

Facility layout problems have been analyzed by researchers for many years. In production management and operations research areas facility layout problems have received great attention. Facility layout is the problem of choosing department location in the given plant size. For the history of solution approach to generate a layout, see Raoot and Rakshit. Normally, there are two criteria in the facility layout models. One is minimizing the total distance traveled (Minisum), and the other is minimizing the maximum distance traveled (Minimax). Two distance measures commonly used to facility layout models are rectilinear and Euclidean distances. Since the measure of effectiveness for layout problems in the plant is related to the flow of materials, it is important to have correct information about the flow of material in the plant.

Reviews

Required fields are marked *. Your email address will not be published.