A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
From MaRDI portal
Publication:2253379
Recommendations
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- A new mixed integer programming formulation for facility layout design using flexible bays
- Heuristics for the dynamic facility layout problem with unequal-area departments
- The multi-bay manufacturing facility layout problem
- Efficient models for the facility layout problem
Cites work
- A graph-pair representation and MIP-model-based heuristic for the unequal-area facility layout problem
- A new mixed integer programming formulation for facility layout design using flexible bays
- A new simulated annealing algorithm for the facility layout problem
- A simulated annealing algorithm for allocating space to manufacturing cells
- A Tabu-Search Heuristic for the Dynamic Plant Layout Problem
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- An interactive layout heuristic based on hexagonal adjacency graphs
- An iterative facility layout algorithm
- Applying ant system for solving unequal area facility layout problems
- Applying the sequence-pair representation to optimal facility layout designs
- Enhanced Model Formulations for Optimal Facility Layout
- Exploiting tabu search memory in constrained problems
- Hashing vectors for tabu search
- scientific article; zbMATH DE number 108390 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- Improved tabu search heuristics for the dynamic space allocation problem
- Optimal facility layout design
- Preprocessing for static and dynamic facility layout problems
- Solving zero-one mixed integer programming problems using tabu search
- Static and Dynamic Layout Problems with Varying Areas
- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- Tabu Search—Part I
- Tabu Search—Part II
- The multi-bay manufacturing facility layout problem
- The Reactive Tabu Search
Cited in
(15)- Stats: A slicing tree and tabu search based heuristic for the unequal area facility layout problem
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem
- A -accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Block layout for attraction-based enterprises
- Double-row facility layout with replicate machines and split flows
- Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- An improved two-stage optimization-based framework for unequal-areas facility layout
- Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research
- The zone-based dynamic facility layout problem
- Metaheuristics and a matheuristic for solving the facility layout problem in the presence of alternative process plans and machine redundancy
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
- A new mixed integer programming formulation for facility layout design using flexible bays
This page was built for publication: A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253379)
