Configuring cellular manufacturing systems: a quadratic integer programming formulation and a simple interchange heuristic
From MaRDI portal
Publication:4398913
Recommendations
Cites work
- A method for finding minimal bottle-neck cells for grouping part-machine families†
- An ideal seed non-hierarchical clustering algorithm for cellular manufacturing
- Grouping of parts and components in flexible manufacturing systems
- scientific article; zbMATH DE number 3469876 (Why is no real title available?)
- scientific article; zbMATH DE number 3800811 (Why is no real title available?)
- Seed selection procedures for cell formation heuristics
- ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
Cited in
(11)- Chaining set partitions with applications in manufacturing system configuration planning
- A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing
- The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem
- An improved linearization strategy for zero-one quadratic programming problems
- Models for machine-part grouping in cellular manufacturing
- A new approach for solving the P-median problem in group technology
- A mathematical programming approach to joint cell formation and operation allocation in cellular manufacturing
- Design of cellular manufacturing systems in tandem configuration
- An efficient heuristic for the design of cellular manufacturing systems with multiple identical machines
- A Triangular Stochastic Facility Layout Problem in a Cellular Manufacturing System
- An iterative clustering approach based on material flow requirements for cellular designs
This page was built for publication: Configuring cellular manufacturing systems: a quadratic integer programming formulation and a simple interchange heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398913)
