Worst-case analysis of an algorithm for cellular manufacturing
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1193186
- Knapsack-based Algorithms for Designing Cellular Manufacturing Systems
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- The cellular manufacturing layout problem
- An algorithm for the cell formation and the machine selection problems in the design of a cellular manufacturing system
- A manufacturing cell formation problem with a maximum cell workload constraint
- Designing manufacturing cells: A staged approach and a tabu search algorithm
- An efficient heuristic for the design of cellular manufacturing systems with multiple identical machines
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
Cites work
Cited in
(7)- Clustering of objects and attributes for manufacturing and marketing applications
- An exact model for cell formation in group technology
- Cell formation with operation times of jobs for even distribution of workloads
- Configuration of cellular manufacturing systems using association rule induction
- Measures of grouping efficiency in cellular manufacturing systems
- Team formation based on group technology: a hybrid grouping genetic algorithm approach
- The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research
This page was built for publication: Worst-case analysis of an algorithm for cellular manufacturing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309957)