| Article ID: | iaor20119710 |
| Volume: | 39 |
| Issue: | 6 |
| Start Page Number: | 1225 |
| End Page Number: | 1235 |
| Publication Date: | Jun 2012 |
| Journal: | Computers and Operations Research |
| Authors: | Barut Mehmet, Keskinturk Timur, Yildirim Mehmet B |
| Keywords: | heuristics: ant systems, combinatorial optimization, heuristics: genetic algorithms |
This study introduces the problem of minimizing average relative percentage of imbalance (ARPI) with sequence‐dependent setup times in a parallel‐machine environment. A mathematical model that minimizes ARPI is proposed. Some heuristics, and two metaheuristics, an ant colony optimization algorithm and a genetic algorithm are developed and tested on various random data. The proposed ant colony optimization method outperforms heuristics and genetic algorithm. On the other hand, heuristics using the cumulative processing time obtain better results than heuristics using setup avoidance and a hybrid rule in assignment.