An improved scatter search algorithm for solving job shop scheduling problems with parallel batch processing machine

一种改进的分散搜索算法,用于解决具有并行批处理机床的作业车间调度问题

阅读:2

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.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。