Parallel-Machine Scheduling Problem: An Experimental Study of Instances Difficulty and Algorithms Performance-Reference-Cited by-同舟云学术

Parallel-Machine Scheduling Problem: An Experimental Study of Instances Difficulty and Algorithms Performance

Published:2020-11-07 Issue: Volume: Page:13-49
ISSN:1860-949X
Container-title:Recent Advances of Hybrid Intelligent Systems Based on Soft Computing
language:
Short-container-title:

Author:

Ramos-Figueroa Octavio,Quiroz-Castellanos Marcela,Carmona-Arroyo Guadalupe,Vázquez Betsabé,Kharel Rupak

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-58728-4_2

Reference49 articles.

1. C. Blum, A. Roli, Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. (CSUR) 35(3), 268–308 (2003)

2. M.R. Garey, D.S. Johnson, Computers and Intractability, vol. 29 (W. H, Freeman New York, 2002)

3. D. Hains, Structure in combinatorial optimization and its effect on heuristic performance. Ph.D. thesis, Colorado State University. Libraries (2013)

4. J. Kanda, A. de Carvalho, E. Hruschka, C. Soares, P. Brazdil, Meta-learning to select the best meta-heuristic for the traveling salesman problem: a comparison of meta-features. Neurocomputing 205, 393–406 (2016)

5. M. Chiarandini, L. Paquete, M. Preuss, E. Ridge, Experiments on metaheuristics: methodological overview and open issues. Technical Report DMF-2007-03-003, The Danish Mathematical Society, Denmark (2007)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Outranking-based multi-objective PSO for scheduling unrelated parallel machines with a freight industry-oriented application;Engineering Applications of Artificial Intelligence;2022-02