Pages that link to "Item:Q2253379"
From MaRDI portal
The following pages link to A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays (Q2253379):
Displaying 12 items.
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout (Q274980) (← links)
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
- An improved two-stage optimization-based framework for unequal-areas facility layout (Q331972) (← links)
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance (Q723980) (← links)
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation (Q1651538) (← links)
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem (Q1651637) (← links)
- A \(\beta\)-accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics (Q1681320) (← links)
- Block layout for attraction-based enterprises (Q1754188) (← links)
- Double-row facility layout with replicate machines and split flows (Q2003412) (← links)
- Component allocation cost minimization for a multistate computer network subject to a reliability threshold using tabu search (Q2515273) (← links)
- Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research (Q4609783) (← links)
- The zone-based dynamic facility layout problem (Q5884346) (← links)
