An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan.
Manzhan GuXiwen LuJinwei GuPublished in: J. Comb. Optim. (2017)
Keyphrases
- job shop scheduling
- asymptotically optimal
- learning algorithm
- np hard
- particle swarm optimization
- k means
- similarity measure
- simulated annealing
- cost function
- optimal solution
- dynamic programming
- probabilistic model
- scheduling problem
- worst case
- search space
- clustering method
- combinatorial optimization
- objective function