Ant Colony System based approach to single machine scheduling problems: Weighted tardiness scheduling problem

Author(s):  
Ana Madureira ◽  
Diamantino Falcao ◽  
Ivo Pereira

This study reports the single machine scheduling problem for finding the minimum the total weighted tardiness. As the problem is non-deterministic polynomial-time hard (NP-hard), the problem might not be answered by the exact solution techniques. Henceforth, different heuristics and meta-heuristics were recommended by different practitioners to tackle the problem. A modified elephant herd optimization algorithm (MEHOA) is investigated in the present work to solve the single machine total weighted tardiness scheduling problem (SMTWTSP). The performance of the anticipated approach is studied with the test instances available in the OR library. The outcomes are compared with several different algorithms offered in the literature and indicate the efficacy of the developed methodology.


2019 ◽  
Vol 276 (1) ◽  
pp. 79-87 ◽  
Author(s):  
Alessandro Agnetis ◽  
Bo Chen ◽  
Gaia Nicosia ◽  
Andrea Pacifici

Sign in / Sign up

Export Citation Format

Share Document