A Statistical Comparison of Metaheuristics for Unrelated Parallel Machine Scheduling Problems with Setup Times

Ana Rita Antunes, Marina A. Matos, Ana Maria A. C. Rocha, Lino A. Costa and Leonilde R. Varela
Additional contact information
Ana Rita Antunes: ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal
Marina A. Matos: ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal
Ana Maria A. C. Rocha: ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal
Lino A. Costa: ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal
Leonilde R. Varela: ALGORITMI Center, University of Minho, 4710-057 Braga, Portugal

Mathematics, 2022, vol. 10, issue 14, 1-19

Abstract: Manufacturing scheduling aims to optimize one or more performance measures by allocating a set of resources to a set of jobs or tasks over a given period of time. It is an area that considers a very important decision-making process for manufacturing and production systems. In this paper, the unrelated parallel machine scheduling problem with machine-dependent and job-sequence-dependent setup times is addressed. This problem involves the scheduling of tasks on unrelated machines with setup times in order to minimize the makespan. The genetic algorithm is used to solve small and large instances of this problem when processing and setup times are balanced (Balanced problems), when processing times are dominant (Dominant P problems), and when setup times are dominant (Dominant S problems). For small instances, most of the values achieved the optimal makespan value, and, when compared to the metaheuristic ant colony optimization (ACOII) algorithm referred to in the literature, it was found that there were no significant differences between the two methods. However, in terms of large instances, there were significant differences between the optimal makespan obtained by the two methods, revealing overall better performance by the genetic algorithm for Dominant S and Dominant P problems.

Keywords: scheduling; unrelated parallel machines; sequence-dependent tasks; makespan; metaheuristics; genetic algorithm; statistical analysis (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/14/2431/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/14/2431/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:14:p:2431-:d:861016

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().