A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
From MaRDI portal
Publication:3582665
Recommendations
- Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches
- Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems
- Capacity and tool allocation problem in flexible manufacturing systems
- The resource allocation problem in flexible manufacturing systems
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- An application of Lagrangian relaxation to a capacity planning problem under uncertainty
- A Lagrangean relaxation approach for capacitated lot sizing problem with setup times
- An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem
Cited in
(6)- Formulations of the capacity planning problem considering manufacturing flexibility
- Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches
- Using Constraint Satisfaction Approach to Solve the Capacity Allocation Problem for Photolithography Area
- Capacity and tool allocation problem in flexible manufacturing systems
This page was built for publication: A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582665)
