Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine.
Alessandro DruettoAndrea GrossoPublished in: Comput. Oper. Res. (2022)
Keyphrases
- column generation
- linear programming
- scheduling problem
- flowshop
- single machine
- linear programming relaxation
- completion times
- linear program
- integer programming
- exact solution
- branch and bound
- parallel machines
- integer program
- release dates
- vehicle routing
- set partitioning
- scheduling jobs
- integer linear programming
- lagrangean relaxation
- processing times
- parallel machine scheduling problem
- batch processing
- mixed integer programming
- optimal solution
- vehicle routing problem with time windows
- grasp with path relinking
- cutting plane
- exact algorithms
- lagrangian relaxation
- np hard
- sequence dependent setup times
- constraint programming
- heuristic search
- setup times
- knapsack problem
- identical machines
- maximum lateness
- dantzig wolfe decomposition
- mixed integer
- upper bound
- dual variables
- special case