Applying the sequence-pair representation to optimal facility layout designs

DOI10.1016/J.ORL.2006.10.007MaRDI QIDQ2465955zbMATH OpenOpenAlexFDO

Authors R. 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

zbMATH Keywords

discrete optimizationfacility layoutmixed-integer programmingsequence-pair representationvalid inequalities

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Mixed integer programming (90C11)

Recommendations

• Optimal facility layout design
• The facility layout problem
• A new mixed integer programming formulation for facility layout design using flexible bays
• A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
• Efficient models for the facility layout problem

Cites work

• A nonlinear optimization approach for solving facility layout problems
• An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
• Enhanced Model Formulations for Optimal Facility Layout
• Optimal facility layout design

Cited in

(20)

• Applying ant system for solving unequal area facility layout problems
• Optimal facility layout and material handling network design
• A model to optimize rack layout in a retail store
• Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
• A new solution method of ant colony-based logistic center area layout problem
• 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
• An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
• Global approaches for facility layout and VLSI floorplanning
• 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
• Compact layout of logistics facilities based on O-tree representation
• A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
• Computational Science – ICCS 2005
• 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
• New perspectives in VLSI design automation: deterministic packing by sequence pair
• Facility layout based on sequence analysis: design of flowshops
• A new optimization model to support a bottom-up approach to facility design

This page was built for publication: Applying the sequence-pair representation to optimal facility layout designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465955)