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...
Uloženo v:
| Vydáno v: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
International Journal of Combinatorial Optimization Problems and Informatics
2011
|
| Témata: | |
| On-line přístup: | https://www.redalyc.org/articulo.oa?id=265219635003 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|