Complexity Indicators applied to the Job Shop Scheduling Problem to discriminate the best Algorithm.
Jorge A. Ruiz-VanoyeOcotlán Díaz-ParraJosé Crispín Zavala DíazPublished in: Int. J. Comb. Optim. Probl. Informatics (2011)
Keyphrases
- job shop scheduling problem
- critical path
- worst case
- computational complexity
- simulated annealing
- cost function
- memetic algorithm
- optimization algorithm
- information retrieval
- k means
- job shop scheduling
- benchmark problems
- dynamic programming
- np hard
- machine learning
- optimal solution
- clustering method
- tabu search
- ant colony optimization
- knapsack problem
- scheduling problem
- graph model
- probabilistic model
- objective function
- tabu search algorithm