A Two-Individual-Based Evolutionary Algorithm for Flexible Assembly Job Shop Scheduling Problem with Uncertain Interval Processing Times
The assembly job shop is a prevalent production organization mode in manufacturing enterprises. During the processing and assembly of products, operation processing times are influenced by numerous factors, leading to significant uncertainty. This paper investigates the flexible assembly job shop sc...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-11-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/14/22/10304 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The assembly job shop is a prevalent production organization mode in manufacturing enterprises. During the processing and assembly of products, operation processing times are influenced by numerous factors, leading to significant uncertainty. This paper investigates the flexible assembly job shop scheduling problem (FAJSP) with uncertain processing times, where processing times are represented as variable interval numbers. We develop a robust optimization model for the FAJSP, utilizing confidence level estimation to determine the ranges of processing times and reformulating the model based on the chance-constrained method. A two-individual-based master–apprentice evolutionary (MAE) algorithm is proposed. Two effective encoding schemes are designed to prevent the generation of infeasible solutions under assembly sequence constraints. Additionally, a decoding method based on interval scheduling theory is devised to accurately represent interval processing times. Case studies are conducted to validate the effectiveness of the proposed robust optimization model and demonstrate the superiority of the MAE algorithm. |
|---|---|
| ISSN: | 2076-3417 |