A polynomial algorithm for a multi-item capacitated production planning problem.
Meltem Denizel-SivriS. Selçuk ErengüçPublished in: Oper. Res. Lett. (1993)
Keyphrases
- multi item
- lot sizing
- multi period
- cost function
- np hard
- learning algorithm
- production planning
- planning horizon
- dynamic programming
- worst case
- knapsack problem
- integer programming
- mathematical model
- lower and upper bounds
- multistage
- simulated annealing
- probabilistic model
- computational complexity
- optimal solution
- objective function