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