Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations.
Shi LiPublished in: FOCS (2017)
Keyphrases
- minimize total
- linear programming relaxation
- single machine
- weighted tardiness
- release dates
- total cost
- parallel machines
- knapsack problem
- scheduling problem
- lower bound
- linear programming
- column generation
- integer programming
- branch and bound
- integer program
- cutting plane
- processing times
- feasible solution
- single machine scheduling problem
- optimal solution
- mixed integer programming
- valid inequalities
- dynamic programming
- precedence constraints