Ant colony optimization based algorithm for solving scheduling problems with setup times on parallel machines
In this paper, a production scheduling problem with sequence-dependent setup times on a set of unrelated parallel machines is addressed. The objective function is to minimize the total setup time . An algorithm based on ant colony optimization combined with a heuristic is proposed for solving large...
Elmentve itt :
| Szerzők: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Könyv része |
| Megjelent: |
2018
|
| Sorozat: | Conference of PhD Students in Computer Science
11 |
| Kulcsszavak: | Számítástechnika, Algoritmus, Programozás |
| Online Access: | http://acta.bibl.u-szeged.hu/61800 |
| Tartalmi kivonat: | In this paper, a production scheduling problem with sequence-dependent setup times on a set of unrelated parallel machines is addressed. The objective function is to minimize the total setup time . An algorithm based on ant colony optimization combined with a heuristic is proposed for solving large problems efficiently. It is shown that even a simpler version of the problem can not be tackled with MILP. ACO gives good results for the simpler problem version in a reasonable time. Even ACO can not give good results for the industrial problem. However, ACO combined with the heuristic can give us satisfactory results for the industrial problem in a reasonable time. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 188-191 |