What people are saying - Write a review
We haven't found any reviews in the usual places.
The Plant Layout Problem
Computerized Layout Planning
SingleFacility Location Problems
7 other sections not shown
Other editions - View all
ALDEP algorithm alternative analysis assumed bound on TC branch and bound Chapter closeness ratings computerized layout considered constraints contour lines coordinate cover problem CRAFT defined denote departments developed diameter diamond discussion distance traveled docks dual problem equal Euclidean distance Euclidean problem evaluating example problem existing facilities existing machines facility layout facility location problems feasible solution flow formulation from-to chart given in Figure go to step grid squares heuristic procedures Industrial Engineering inequality integer interchange item movement lattice points layout and location layout design least-cost layout linear linear-programming problem lower bound material-handling matrix maximum minimax configurations minimax location minimize minimum total cost node objective function Operations Research optimum location optimum solution Property quadratic assignment problem ratio scale rectilinear distance REL chart shown in Figure solution procedure solving storage Suppose Systematic Layout Planning tion upper bound Vollmann warehouse design zero