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...

Full description

Saved in:
Bibliographic Details
Main Authors: Hanpeng Wang, Hengen Xiong, Wenlu Zuo, Shuangyuan Shi
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!
_version_ 1849737476657119232
author Hanpeng Wang
Hengen Xiong
Wenlu Zuo
Shuangyuan Shi
author_facet Hanpeng Wang
Hengen Xiong
Wenlu Zuo
Shuangyuan Shi
author_sort Hanpeng Wang
collection DOAJ
description 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.
format Article
id doaj-art-d1ffeddd163b457a9087bb3fbc6aec00
institution DOAJ
issn 2045-2322
language English
publishDate 2025-04-01
publisher Nature Portfolio
record_format Article
series Scientific Reports
spelling doaj-art-d1ffeddd163b457a9087bb3fbc6aec002025-08-20T03:06:54ZengNature PortfolioScientific Reports2045-23222025-04-0115112710.1038/s41598-025-92761-8An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machineHanpeng Wang0Hengen Xiong1Wenlu Zuo2Shuangyuan Shi3School of Mechanical Engineering, Wuhan University of Science and TechnologySchool of Mechanical Engineering, Wuhan University of Science and TechnologySchool of Mechanical Engineering, Wuhan University of Science and TechnologySchool of Computer and Information Science, Hubei Engineering UniversityAbstract 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.https://doi.org/10.1038/s41598-025-92761-8JSP-PBPMImproved scatter searchDecoding strategyBatch job addition algorithm
spellingShingle Hanpeng Wang
Hengen Xiong
Wenlu Zuo
Shuangyuan Shi
An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine
Scientific Reports
JSP-PBPM
Improved scatter search
Decoding strategy
Batch job addition algorithm
title An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine
title_full An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine
title_fullStr An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine
title_full_unstemmed An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine
title_short An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine
title_sort improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine
topic JSP-PBPM
Improved scatter search
Decoding strategy
Batch job addition algorithm
url https://doi.org/10.1038/s41598-025-92761-8
work_keys_str_mv AT hanpengwang animprovedscattersearchalgorithmforsolvingjobshopschedulingproblemswithparallelbatchprocessingmachine
AT hengenxiong animprovedscattersearchalgorithmforsolvingjobshopschedulingproblemswithparallelbatchprocessingmachine
AT wenluzuo animprovedscattersearchalgorithmforsolvingjobshopschedulingproblemswithparallelbatchprocessingmachine
AT shuangyuanshi animprovedscattersearchalgorithmforsolvingjobshopschedulingproblemswithparallelbatchprocessingmachine
AT hanpengwang improvedscattersearchalgorithmforsolvingjobshopschedulingproblemswithparallelbatchprocessingmachine
AT hengenxiong improvedscattersearchalgorithmforsolvingjobshopschedulingproblemswithparallelbatchprocessingmachine
AT wenluzuo improvedscattersearchalgorithmforsolvingjobshopschedulingproblemswithparallelbatchprocessingmachine
AT shuangyuanshi improvedscattersearchalgorithmforsolvingjobshopschedulingproblemswithparallelbatchprocessingmachine