Publication
Application of the simulated annealing algorithm to minimize the makespan on the unrelated parallel machine scheduling problem with setup times
| Summary: | In this paper, the unrelated parallel machine scheduling problem considering machine-dependent and job sequence-dependent setup times is addressed. This problem involves the scheduling of n jobs on m unrelated machines with setup times in order to minimize the makespan. The Simulated Annealing algorithm is used to solve four sets of small scheduling problems, from the literature, on two unrelated machines: the first one has six jobs, the second has seven jobs and the third and fourth has eight and nine jobs, respectively. The results seem promising when compared with other methods referred in literature. |
|---|---|
| Main Authors: | Amaral, Gabriela |
| Other Authors: | Costa, Lino; Rocha, Ana Maria A. C.; Varela, M.L.R.; Madureira, Ana |
| Subject: | Scheduling problem Setup times Simulated annealing |
| Year: | 2020 |
| Country: | Portugal |
| Document type: | conference paper |
| Access type: | open access |
| Associated institution: | Universidade do Minho |
| Language: | English |
| Origin: | RepositóriUM - Universidade do Minho |
| Summary: | In this paper, the unrelated parallel machine scheduling problem considering machine-dependent and job sequence-dependent setup times is addressed. This problem involves the scheduling of n jobs on m unrelated machines with setup times in order to minimize the makespan. The Simulated Annealing algorithm is used to solve four sets of small scheduling problems, from the literature, on two unrelated machines: the first one has six jobs, the second has seven jobs and the third and fourth has eight and nine jobs, respectively. The results seem promising when compared with other methods referred in literature. |
|---|
Funded activities
No funded projects found.