An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine
Abstract This paper addresses a hybrid processing system in automotive mold casting, which involves single processing machines and parallel batch processing machines. A job shop scheduling problem with parallel batch processing machines (JSP-PBPM) is developed, with the objective of minimizing the m...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-04-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-92761-8 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract This paper addresses a hybrid processing system in automotive mold casting, which involves single processing machines and parallel batch processing machines. A job shop scheduling problem with parallel batch processing machines (JSP-PBPM) is developed, with the objective of minimizing the maximum completion time. First, a solution decoding strategy combined with the JSP-PBPM problem and a batch job addition algorithm is proposed. This approach addresses the impact of operation precedence relationships on conventional decoding strategies and aims to maximize the utilization of parallel batch processing machines for batch operations. Next, an Improved Scatter Search (ISS) algorithm is introduced to solve the problem. The ISS algorithm finds the optimal solution through several steps, including the construction of the initial population, improvement of the initial solution, creation of a reference set, generation of subsets, and refinement of the final solution. Finally, simulation experiments are conducted to verify the feasibility and effectiveness of the proposed algorithm and decoding strategy in solving such problems. |
|---|---|
| ISSN: | 2045-2322 |