Ant colony optimization based algorithm for solving scheduling problems with setup times on parallel machines

Mihály, Zsolt and Sentes, Zsombor and Lelkes, Zoltán: Ant colony optimization based algorithm for solving scheduling problems with setup times on parallel machines. Conference of PhD Students in Computer Science, (11). pp. 188-191. (2018)

[img] Cikk, tanulmány, mű
cscs_2018_201-204.pdf

Download (274kB)

Abstract

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.

Item Type: Article
Event Title: Conference of PhD students in computer science (11.) (2018) (Szeged)
Journal or Publication Title: Conference of PhD Students in Computer Science
Date: 2018
Volume: 11
Page Range: pp. 188-191
Uncontrolled Keywords: Számítástechnika, Algoritmus, Programozás
Additional Information: Bibliogr.: p. 190-191. ; összefoglalás angol nyelven
Date Deposited: 2019. Nov. 04. 14:56
Last Modified: 2019. Nov. 04. 14:56
URI: http://acta.bibl.u-szeged.hu/id/eprint/61800

Actions (login required)

View Item View Item