Solution approaches for the double-row equidistant facility layout problem

DOI10.1007/978-3-319-28697-6_3MaRDI QIDQ2806884zbMATHOpenAlexFDO

Authors Miguel F. Anjos, Anja Fischer, Philipp Hungerländer

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_3

Mathematics Subject Classification ID

Linear programming (90C05) Semidefinite programming (90C22) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• A new exact approach to the space-free double row layout problem
• Provably near-optimal solutions for very large single-row facility layout problems
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• New exact approaches to row layout problems
• Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes

Cites work

• A Spectral Bundle Method for Semidefinite Programming
• A computational study and survey of methods for the single-row facility layout problem
• A new lower bound for the single row facility layout problem

Cited in

(6)

• A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
• A new exact approach to the space-free double row layout problem
• Improved exact approaches for row layout problems with departments of equal length
• A decomposition-based algorithm for the double row layout problem
• Decorous combinatorial lower bounds for row layout problems
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions

Describes a project that uses

Uses Software

• Gurobi

This page was built for publication: Solution approaches for the double-row equidistant facility layout problem

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