On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines.
Shlomo KarhiDvir ShabtayPublished in: J. Comb. Optim. (2013)
Keyphrases
- scheduling problem
- learning algorithm
- np hard
- optimal solution
- initial set
- dynamic programming
- input data
- detection algorithm
- k means
- online learning
- decomposition algorithm
- flowshop
- cost function
- lower and upper bounds
- parallel machines
- solution space
- minimizing makespan
- convergence rate
- image set
- greedy algorithm
- convex hull
- tabu search
- computational complexity