On the complexity of short-term production planning and the near-optimality of a sequential assignment problem heuristic approach.
Adar KalirYonatan ZoreaAdir PridorLev M. BregmanPublished in: Comput. Ind. Eng. (2013)
Keyphrases
- short term
- production planning
- long term
- mixed integer programming
- optimal solution
- knapsack problem
- multi period
- integer programming
- short term and long term
- lot sizing
- stock market
- load forecasting
- dynamic programming
- planning horizon
- production cost
- medium term
- infinite horizon
- worst case
- long term memory
- np hard
- power generation
- neural network
- short and long term
- greedy algorithm
- evolutionary algorithm
- computational complexity
- constraint satisfaction
- special case
- particle swarm optimization
- state space