A minimum concave-cost dynamic network flow problem with an application to lot-sizing.
Stephen C. GravesJames B. OrlinPublished in: Networks (1985)
Keyphrases
- lot sizing
- minimum cost
- network flow problem
- mixed integer
- fixed cost
- minimal cost
- multi item
- multistage
- setup cost
- np hard
- single item
- rolling horizon
- network flow
- cutting stock
- multi commodity
- lead time
- lot size
- cutting plane
- planning horizon
- total cost
- approximation algorithms
- mixed integer programming
- production planning
- objective function
- network design problem
- tabu search
- sufficient conditions
- graphical models
- optimal solution