A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems
From MaRDI portal
Publication:2565770
Recommendations
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem
- Directional decomposition heuristic for a linear machine-cell location problem.
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Joint determination of machine cells and linear intercell layout
- Locating cells with bottleneck machines in cellular manufacturing systems
Cites work
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- A sequence-based materials flow procedure for designing manufacturing cells
- A two-phase procedure for duplicating bottleneck machines in a linear layout, cellular manufacturing system
- An n‐step, 2‐variable search algorithm for the component placement problem
- Directional decomposition heuristic for a linear machine-cell location problem.
- Formation of machine cells and part families: A modified p-median model and a comparative study
- scientific article; zbMATH DE number 3885090 (Why is no real title available?)
- Locating cells with bottleneck machines in cellular manufacturing systems
- Machine assignment in a nonlinear multi-product flowline
- Numerical investigations on quadratic assignment problems
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Reducing work-in-process movement for multiple products in one-dimensional layout problems
Cited in
(4)
This page was built for publication: A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565770)