A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines.
Franklina Maria Bragion ToledoVinícius Amaral ArmentanoPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- parallel machines
- unrelated parallel machines
- setup times
- scheduling jobs
- scheduling problem
- lagrangian relaxation
- total tardiness
- sequence dependent setup times
- lot sizing
- optimal solution
- dantzig wolfe
- multi item
- precedence constraints
- strongly np hard
- massively parallel
- minimize total
- release dates
- single server
- parallel computing
- flowshop
- open shop
- mixed integer programming
- tabu search
- feasible solution
- np hard
- single machine
- shared memory
- simulated annealing
- production planning
- production system
- distributed systems
- integer programming
- dynamic programming
- special case
- search algorithm