| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 723812 | IFAC Proceedings Volumes | 2006 | 6 Pages |
Abstract
This paper applies the new developed heuristic electromagnetism-like mechanism (EM) algorithm for the permutation flowshop scheduling problem. This algorithm simulates the electromagnetism theory by considering each solution as an electrical charge. Through the attraction-repulsion of the charges, solutions move to the optimality without being trapped into local optima. We make use of random key for building the relationships between the algorithm and the problem model. When comparing the computational results with GA and other heuristics, EM showed great superiority than the others, especially for some large scaled scheduling problems.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
