A branch and price algorithm for single-machine completion time variance.
Shijin WangYing LuPublished in: Comput. Oper. Res. (2019)
Keyphrases
- single machine
- competitive ratio
- objective function
- optimal solution
- dynamic programming
- learning algorithm
- convergence rate
- single machine scheduling problem
- average case
- linear programming
- simulated annealing
- np hard
- search space
- scheduling problem
- hybrid algorithm
- solution quality
- processing times
- search procedure
- minimize total
- computational complexity
- total weighted tardiness