The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms
From MaRDI portal
Publication:3296257
DOI10.1007/978-3-030-26458-1_20zbMath1436.90164OpenAlexW2999166991MaRDI QIDQ3296257
Dilip Datta, Zahnupriya Kalita
Publication date: 7 July 2020
Published in: Nature-Inspired Methods for Metaheuristics Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-26458-1_20
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm
- Single row facility layout problem using a permutation-based genetic algorithm
- Efficient models for the facility layout problem
- Sequencing with general precedence constraints
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A heuristic procedure for the single-row facility layout problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- An efficient tabu algorithm for the single row facility layout problem
- On the exact solution of a facility layout problem
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes
- On the One-Dimensional Space Allocation Problem
- On Solving A One-Dimensional Space Allocation Problem With Integer Programming
- Modelling, measurement and evaluation of sequencing flexibility in manufacturing systems
- Sequencing Operations to Minimize In-Process Inventory Costs
- One-Dimensional Space Allocation: An Ordering Algorithm
- Unnamed Item
- Unnamed Item
This page was built for publication: The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms
