A close neighbour algorithm for designing cellular manufacturing systems
From MaRDI portal
Publication:3354590
DOI10.1080/00207549108948069zbMath0729.90577OpenAlexW2040918465MaRDI QIDQ3354590
Publication date: 1991
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207549108948069
Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The threshold value of group similarity in the formation of cellular manufacturing systems ⋮ Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems ⋮ An efficient exact model for the cell formation problem with a variable number of production cells ⋮ A hybrid grouping genetic algorithm for the cell formation problem ⋮ Solving group technology problems via clique partitioning ⋮ A GRASP heuristic for the manufacturing cell formation problem ⋮ A tabu search algorithm for the cell formation problem with part machine sequencing ⋮ Exact model for the cell formation problem ⋮ Machine-component grouping in cellular manufacturing by multidimensional scaling ⋮ Principal component analysis for evaluating the feasibility of cellular manufacturing without initial machine-part matrix clustering ⋮ A neural network-based cell formation algorithm in cellular manufacturing ⋮ A vector analytic VECAN method for solving the machine-part grouping problem in GT ⋮ Moments-based clustering techniques for manufacturing cell formation ⋮ A water flow-like algorithm for manufacturing cell formation problems ⋮ The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research ⋮ Evolving knowledge for the solution of clustering problems in cellular manufacturing ⋮ Configuration of cellular manufacturing systems using association rule induction ⋮ An ant colony optimization metaheuristic for machine-part cell formation problems ⋮ Group technology by an ant system algorithm ⋮ Expansion of group technology to handle logical operations ⋮ Heuristic Algorithm for the Cell Formation Problem ⋮ A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems ⋮ Designing cellular manufacturing systems by a truncated tree search ⋮ Cell formation with operation times of jobs for even distribution of workloads ⋮ Models for machine-part grouping in cellular manufacturing ⋮ Grouping index: a new quantitative criterion for goodness of block-diagonal forms in group technology
Cites Work
- Unnamed Item
- KBSS: A knowledge-based system for scheduling in automated manufacturing
- Grouping of parts and components in flexible manufacturing systems
- Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985))
- An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
- Group technology in production management: The short horizon planning level
- ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
