Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations.
Shi LiPublished in: CoRR (2017)
Keyphrases
- minimize total
- linear programming relaxation
- single machine
- weighted tardiness
- total cost
- parallel machines
- release dates
- scheduling problem
- knapsack problem
- lower bound
- integer programming
- column generation
- linear programming
- cutting plane
- integer program
- feasible solution
- single machine scheduling problem
- cost sensitive
- mixed integer programming
- single server
- processing times
- misclassification costs
- precedence constraints
- cost function
- objective function