A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem.
Sekoun KébéNajiba SbihiBernard PenzPublished in: J. Intell. Manuf. (2012)
Keyphrases
- multi item
- lagrangean relaxation
- dantzig wolfe
- optimal solution
- grasp with path relinking
- column generation
- feasible solution
- set covering problem
- lot sizing
- data storage
- multi period
- supply chain
- set covering
- storage and retrieval
- storage requirements
- linear program
- setup times
- tabu search
- file system
- upper bound
- dynamic programming
- lower bound
- mixed integer programming
- storage devices
- branch and bound
- objective function
- combinatorial auctions
- particle swarm optimization
- decision making
- lead time
- linear programming
- integer programming