An improved mixed-integer programming model for the double row layout of facilities

DOI10.1007/s11590-018-1263-9zbMath1417.90105OpenAlexW2800303838MaRDI QIDQ1733337

L. D. Secchin, André R. S. Amaral

Publication date: 21 March 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1263-9

zbMATH Keywords

integer programmingcombinatorial optimizationfacility layout

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items

Decorous combinatorial lower bounds for row layout problems, A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem, A decomposition-based algorithm for the double row layout problem, Mathematical optimization approach for facility layout on several rows, Double-row facility layout with replicate machines and split flows, New exact approaches to row layout problems, Exact approaches for the combined cell layout problem

Cites Work

• A parallel ordering problem in facilities layout
• The corridor allocation problem
• A polyhedral approach to the single row facility layout problem
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
• A new lower bound for the single row facility layout problem
• Optimal solutions for the double row layout problem
• On the exact solution of a facility layout problem
• The double row layout problem
• An Exact Approach to the One-Dimensional Facility Layout Problem
• One-Dimensional Space Allocation: An Ordering Algorithm