Temporal and spatial Lagrangean decompositions in multi-site, multi-period production planning problems with sequence-dependent changeovers.
Sebastian Terrazas-MorenoPhilipp A. TrotterIgnacio E. GrossmannPublished in: Comput. Chem. Eng. (2011)
Keyphrases
- planning problems
- multi period
- production planning
- multi site
- facility location problem
- planning horizon
- domain independent
- heuristic search
- state space
- lot size
- integer programming
- geographically distributed
- production system
- production cost
- lot sizing
- facility location
- upper bound
- multi item
- column generation
- routing problem
- infinite horizon
- total cost
- lower bound
- domain specific
- temporal constraints
- mixed integer programming
- knapsack problem
- optimal solution
- data envelopment analysis
- approximation algorithms
- optimization problems
- search algorithm
- distributed computing
- special case
- remote sites
- machine learning