Article: A multi-threaded parallel iterative greedy algorithm for distributed flowshop group scheduling problems with preventive maintenance Journal: International Journal of Automation and Control (IJAAC) 2025 Vol.19 No.3 pp.265 - 286 Abstract: In actual production, factories not only pursue productivity, but also pay attention to the reliability and stability of the production process. For the continuity of production machines, this paper investigates the distributed flow shop group scheduling problem with preventive maintenance (DFGSP/PM). In order to minimise the makespan, a mathematical model of DFGSP/PM is developed and a multi-threaded parallel iterative greedy (MPIG) algorithm is proposed. A greedy NEH (GNEH) method is designed to generate the initial solution. In order to couple the two subproblems of DFGSP/PM, a two-stage destruction and reconstruction is designed. A multi-threaded parallel local search strategy (MPLS) is introduced to improve the search efficiency of the MPIG, so that the optimal insertion positions of the groups in the sequence can be searched faster and the two subproblems can be coupled effectively. Effectiveness analysis has demonstrated that the proposed MPIG significantly reduces computation time and expands the search space. Inderscience Publishers - linking academia, business and industry through research

Title: A multi-threaded parallel iterative greedy algorithm for distributed flowshop group scheduling problems with preventive maintenance

Authors: Xiaobin Sun; Hongyan Sang; Wanzhong Wu; Yasheng Zhao; Qiuyang Han

Addresses: School of Computer Science, Liaocheng University, Liaocheng, 252000, China ' School of Computer Science, Liaocheng University, Liaocheng, 252000, China ' School of Computer Science, Liaocheng University, Liaocheng, 252000, China ' School of Computer Science, Liaocheng University, Liaocheng, 252000, China ' School of Computer Science, Liaocheng University, Liaocheng, 252000, China

Abstract: In actual production, factories not only pursue productivity, but also pay attention to the reliability and stability of the production process. For the continuity of production machines, this paper investigates the distributed flow shop group scheduling problem with preventive maintenance (DFGSP/PM). In order to minimise the makespan, a mathematical model of DFGSP/PM is developed and a multi-threaded parallel iterative greedy (MPIG) algorithm is proposed. A greedy NEH (GNEH) method is designed to generate the initial solution. In order to couple the two subproblems of DFGSP/PM, a two-stage destruction and reconstruction is designed. A multi-threaded parallel local search strategy (MPLS) is introduced to improve the search efficiency of the MPIG, so that the optimal insertion positions of the groups in the sequence can be searched faster and the two subproblems can be coupled effectively. Effectiveness analysis has demonstrated that the proposed MPIG significantly reduces computation time and expands the search space.

Keywords: distributed flowshop scheduling; preventive maintenance; iterative greedy algorithm; group scheduling; parallel computing.

DOI: 10.1504/IJAAC.2025.145906

International Journal of Automation and Control, 2025 Vol.19 No.3, pp.265 - 286

Received: 28 Mar 2024
Accepted: 06 May 2024
Published online: 30 Apr 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: A multi-threaded parallel iterative greedy algorithm for distributed flowshop group scheduling problems with preventive maintenance

Keep up-to-date