Complexity Indicators applied to the Job Shop Scheduling Problem to discriminate the best Algorithm
In this paper, we propose the application of discriminant analysis to select appropriately the algorithm that better solves an instance of the Job Shop Scheduling Problem. The discriminant analysis was used as a method of machine learning to find the relation between the characteristics of the probl...
Збережено в:
| Опубліковано в:: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Автори: | , , |
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Предмети: | |
| Онлайн доступ: | https://www.redalyc.org/articulo.oa?id=265219635003 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|