期刊名称：International Journal of Combinatorial Optimization Problems and Informatics
印刷版ISSN：2007-1558
电子版ISSN：2007-1558
出版年度：2011
卷号：2
期号：3
页码：25-31
语种：English
出版社：International Journal of Combinatorial Optimization Problems and Informatics
其他摘要：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 problem (complexity indicators) and the performance of algorithms. The prediction of the classification obtained of the discriminant analysis was 60%.
