Pages that link to "Item:Q1316097"
From MaRDI portal
The following pages link to A polynomial algorithm for a multi-item capacitated production planning problem (Q1316097):
Displaying 11 items.
- An optimal algorithm for the multi-item capacitated production planning problem (Q809873) (← links)
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
- Computational complexity of uncapacitated multi-echelon production planning problems (Q1121774) (← links)
- Case study based on a multi-period multi-criteria production planning model (Q1273586) (← links)
- Exact solution procedures for certain planning problems in flexible manufacturing systems (Q1374031) (← links)
- On the polyhedral structure of a multi-item production planning model with setup times (Q1411623) (← links)
- Timed route approaches for large multi-product multi-step capacitated production planning problems (Q2116870) (← links)
- (Q3115579) (← links)
- A heuristic algorithm for a production planning problem in an assembly system (Q3157305) (← links)
- A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (Q3200871) (← links)
- (Q4537752) (← links)