Applying the sequence-pair representation to optimal facility layout designs
From MaRDI portal
Publication:2465955
DOI10.1016/j.orl.2006.10.007zbMath1149.90014OpenAlexW2001668397MaRDI QIDQ2465955
Russell D. Meller, Weiping Chen, Hanif D. Sherali
Publication date: 11 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2006.10.007
valid inequalitiesdiscrete optimizationmixed-integer programmingfacility layoutsequence-pair representation
Related Items
Strong mixed-integer formulations for the floor layout problem ⋮ Beating the SDP bound for the floor layout problem: a simple combinatorial idea ⋮ An efficient algorithm for unequal area facilities layout planning with input and output points ⋮ Optimal facility layout and material handling network design ⋮ A biased random-key genetic algorithm for the unequal area facility layout problem ⋮ An improved two-stage optimization-based framework for unequal-areas facility layout ⋮ A model to optimize rack layout in a retail store ⋮ A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem ⋮ Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions ⋮ A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays ⋮ A convex optimisation framework for the unequal-areas facility layout problem ⋮ A new solution method of ant colony-based logistic center area layout problem ⋮ A new optimization model to support a bottom-up approach to facility design ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems ⋮ Applying ant system for solving unequal area facility layout problems
Cites Work
