Scheduling concurrent production over a finite planning horizon: polynomially solvable cases.
Konstantin KoganPublished in: Comput. Oper. Res. (2000)
Keyphrases
- production planning
- planning horizon
- polynomially solvable
- multi period
- optimal production
- production cost
- np complete
- np hard
- production system
- lot sizing
- lot size
- integer programming
- production rate
- processing times
- production process
- scheduling problem
- capacity expansion
- knapsack problem
- special case
- total cost
- expected cost
- mixed integer programming model
- supply chain
- setup cost
- raw material
- lead time
- multi item
- minimum cost
- infinite horizon
- bayesian networks
- multistage
- lower bound