Using SABC Algorithm for Scheduling Unrelated Parallel Batch Processing Machines Considering Deterioration Effects and Variable Maintenance
This paper investigates the problem of processing jobs on unrelated parallel batch machines, taking into account job arrival times, machine deterioration effects, and variable preventive maintenance (VPM). To address this complex scheduling problem, this paper proposes a Self-Adaptive Artificial Bee...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-09-01
|
| Series: | Engineering Proceedings |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2673-4591/75/1/20 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper investigates the problem of processing jobs on unrelated parallel batch machines, taking into account job arrival times, machine deterioration effects, and variable preventive maintenance (VPM). To address this complex scheduling problem, this paper proposes a Self-Adaptive Artificial Bee Colony (SABC) algorithm, incorporating an adaptive variable neighborhood search mechanism into the algorithm. To verify the effectiveness of the proposed algorithm, we designed comparative experiments, comparing the SABC algorithm with the NSGA-III algorithm on problem instances of different scales. The results indicate that the SABC algorithm outperforms the NSGA-III algorithm in terms of solution quality and diversity, and this advantage becomes more pronounced as the problem scale increases. |
|---|---|
| ISSN: | 2673-4591 |