A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
From MaRDI portal
Publication:3826336
DOI10.1080/00207548908942548zbMath0672.90047OpenAlexW2067924719MaRDI QIDQ3826336
Meir J. Rosenblatt, Boaz Golany
Publication date: 1989
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207548908942548
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Quadratic programming (90C20) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)
Related Items (10)
CLASS: Computerized LAyout Solutions using Simulated annealing ⋮ An algorithm for quadratic assignment problems ⋮ Single and multiple period layout models for automated manufacturing systems ⋮ Integrating facility layout with process selection and capacity planning ⋮ Simulated annealing for machine layout problems in the presence of zoning constraints ⋮ Algorithms for robust single and multiple period layout planning for manufacturing systems ⋮ A ‘fuzzy’ heuristic for the quadratic assignment formulation to the facility layout problem ⋮ Flexible machine layout design for dynamic and uncertain production environments ⋮ An improved tabu search heuristic for solving facility layout design problems ⋮ Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
Cites Work
This page was built for publication: A heuristic algorithm for the quadratic assignment formulation to the plant layout problem