A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times.
Jing XiaoHuasheng YangCanrong ZhangLi ZhengJatinder N. D. GuptaPublished in: Comput. Oper. Res. (2015)
Keyphrases
- lot sizing
- sequence dependent setup times
- simulated annealing
- parallel machines
- setup times
- tabu search
- parallel machine scheduling problem
- multi item
- mixed integer programming
- total tardiness
- total weighted tardiness
- multistage
- maximum lateness
- solution quality
- scheduling problem
- metaheuristic
- production planning
- single item
- genetic algorithm
- optimal solution
- list scheduling
- setup cost
- evolutionary algorithm
- mixed integer
- lead time
- lagrangian relaxation
- combinatorial optimization
- feasible solution
- hybrid algorithm
- search procedure
- single server
- planning horizon
- job shop scheduling problem
- precedence constraints
- release dates
- dynamic programming
- flowshop
- single machine
- approximation algorithms
- probabilistic model
- np hard
- search algorithm