Publication
Multi-objective optimization of the job shop scheduling problem on unrelated parallel machines with sequence-dependent setup times
| Summary: | Several optimization criteria are involved in the job shop scheduling problems encountered in the engineering area. Multi-objective optimization algorithms are often applied to solve these problems, which become even more complex with the advent of Industry 4.0, mostly due to the increase of data from industrial systems. In this work, several instances of the multi-objective job shop scheduling problem on unrelated parallel machines with sequence-dependent setup times are solved using evolutionary approaches. In this problem, the goal is to assign a set of N jobs on M unrelated machines considering sequence-dependent setup times. Several objectives such as makespan, average completion time, cost and energy consumption can be optimized. In this work, single and multi-objective optimization problems are solved considering the minimization of makespan and the average completion time. Preliminary results for the comparison of algorithms on different instances of the problems are presented and statistically analysed. Future work will include problems with more objectives, and to extend this approach to the distributed job shop problem. |
|---|---|
| Main Authors: | Santos, Francisco dos |
| Other Authors: | Costa, Lino; Varela, M.L.R. |
| Subject: | Evolutionary algorithms Job shop scheduling problem Multi-objective optimization |
| Year: | 2023 |
| Country: | Portugal |
| Document type: | conference paper |
| Access type: | restricted access |
| Associated institution: | Universidade do Minho |
| Language: | English |
| Origin: | RepositóriUM - Universidade do Minho |
| Summary: | Several optimization criteria are involved in the job shop scheduling problems encountered in the engineering area. Multi-objective optimization algorithms are often applied to solve these problems, which become even more complex with the advent of Industry 4.0, mostly due to the increase of data from industrial systems. In this work, several instances of the multi-objective job shop scheduling problem on unrelated parallel machines with sequence-dependent setup times are solved using evolutionary approaches. In this problem, the goal is to assign a set of N jobs on M unrelated machines considering sequence-dependent setup times. Several objectives such as makespan, average completion time, cost and energy consumption can be optimized. In this work, single and multi-objective optimization problems are solved considering the minimization of makespan and the average completion time. Preliminary results for the comparison of algorithms on different instances of the problems are presented and statistically analysed. Future work will include problems with more objectives, and to extend this approach to the distributed job shop problem. |
|---|
Funded activities
No funded projects found.