Abstract
We consider the problem of minimising total weighted tardiness on identical parallel machines with grade of service eligibility. Due to the essential complexity of the problem, we apply an electromagnetism-like mechanism (EM), which is a novel metaheuristic, to solve the problem. In the proposed EM, the particle is redesigned to represent a valid assignment of jobs to machines. A distance measure between particles, called ‘1A2B’ distance, is proposed by the concept of a number guessing game. Then, the new attraction and repulsion operators are developed to move a particle to the new particle. To verify the proposed EM, computational experiments are conducted to make a comparison with a recent genetic algorithm (GA). The results show that the proposed EM has a good performance and outperforms the GA for the considered problem.
Disclosure statement
No potential conflict of interest was reported by the authors.