Optimising scheduling in hybrid flowshops for the personal care products industry: a cluster-based decomposition approach

This paper addresses a complex hybrid flowshop (HFS) scheduling problem in the personal care products (PCPs) industry. The limited buffer in the liquid PCPs manufacturing process is uniquely characterised by sustained release, which distinguishes this HFS problem from typical ones. We develop a valid inequality to account for this aspect of the limited buffer and integrate them into a mixed-integer programming (MIP) model that accurately represents the production system. To tackle the inherent intractability of this NP-hard problem, we introduce a cluster-based decomposition (CBD) method. This method employs a similarity measure to cluster jobs into families of liquid PCPs. Our algorithmic framework theoretically guarantees the derivation of optimal solutions within a finite number of iterations. Additionally, we propose polynomial-time procedures that operate independently of the mathematical programming models to obtain lower bounds for the scheduling problem. Numerical results demonstrate that the CBD method outperforms traditional approaches in solution quality. In practical applications, the schedule generated by the CBD method achieves an average makespan reduction of 11.83% compared to existing company schedules. The methodologies developed in this study hold substantial potential for enhancing operational efficiency in the personal care products industry by effectively balancing computational time with scheduling quality. Efficient scheduling is essential in the personal care products (PCPs) industry, where production lines handle various liquid products such as shampoos and shower gels. These products are processed through mixing and packaging stages connected by storage tanks with limited capacity. In practical operations, once packaging begins, the associated tank cannot be released until the batch is fully packaged. This sustained-release constraint frequently causes production bottlenecks, resource conflicts, and efficiency losses. This study develops a practical optimisation framework to support production planning under such complex operational conditions. The proposed approach considers the interactions among production stages, limited buffers, and product families, and adopts a cluster-based decomposition (CBD) strategy to divide large scheduling problems into smaller and more manageable decision problems. This enables production managers to generate high-quality schedules while reducing the computational burden associated with large-scale production planning. Numerical experiments demonstrate that the CBD-generated schedules reduce the makespan by an average of 11.83% compared with existing company schedules. This improvement enhances equipment utilisation, reduces operational costs, and increases production flexibility. The proposed approach provides an effective decision-support tool for production managers in the PCP industry and other process industries with similar scheduling constraints, bridging the gap between theoretical optimisation and real-world manufacturing practice.

Authors

Publication Details

Journal
Figshare
Published
2026-11-16
DOI
https://doi.org/10.6084/m9.figshare.35031616
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Optimising scheduling in hybrid flowshops for the personal care products industry: a cluster-based decomposition approach

Daqin Wang, Yanxia Zhang, Yongyi Wang, Jiazhen Huo et al.
Figshare
Scheduling and Optimization Algorithms
article

Optimising scheduling in hybrid flowshops for the personal care products industry: a cluster-based decomposition approach

Daqin Wang, Yanxia Zhang, Yongyi Wang, Jiazhen Huo, Shengkun Qin, Xiaojin Zheng
article en

Abstract

This paper addresses a complex hybrid flowshop (HFS) scheduling problem in the personal care products (PCPs) industry. The limited buffer in the liquid PCPs manufacturing process is uniquely characterised by sustained release, which distinguishes this HFS problem from typical ones. We develop a valid inequality to account for this aspect of the limited buffer and integrate them into a mixed-integer programming (MIP) model that accurately represents the production system. To tackle the inherent intractability of this NP-hard problem, we introduce a cluster-based decomposition (CBD) method. This method employs a similarity measure to cluster jobs into families of liquid PCPs. Our algorithmic framework theoretically guarantees the derivation of optimal solutions within a finite number of iterations. Additionally, we propose polynomial-time procedures that operate independently of the mathematical programming models to obtain lower bounds for the scheduling problem. Numerical results demonstrate that the CBD method outperforms traditional approaches in solution quality. In practical applications, the schedule generated by the CBD method achieves an average makespan reduction of 11.83% compared to existing company schedules. The methodologies developed in this study hold substantial potential for enhancing operational efficiency in the personal care products industry by effectively balancing computational time with scheduling quality. Efficient scheduling is essential in the personal care products (PCPs) industry, where production lines handle various liquid products such as shampoos and shower gels. These products are processed through mixing and packaging stages connected by storage tanks with limited capacity. In practical operations, once packaging begins, the associated tank cannot be released until the batch is fully packaged. This sustained-release constraint frequently causes production bottlenecks, resource conflicts, and efficiency losses. This study develops a practical optimisation framework to support production planning under such complex operational conditions. The proposed approach considers the interactions among production stages, limited buffers, and product families, and adopts a cluster-based decomposition (CBD) strategy to divide large scheduling problems into smaller and more manageable decision problems. This enables production managers to generate high-quality schedules while reducing the computational burden associated with large-scale production planning. Numerical experiments demonstrate that the CBD-generated schedules reduce the makespan by an average of 11.83% compared with existing company schedules. This improvement enhances equipment utilisation, reduces operational costs, and increases production flexibility. The proposed approach provides an effective decision-support tool for production managers in the PCP industry and other process industries with similar scheduling constraints, bridging the gap between theoretical optimisation and real-world manufacturing practice.

Figshare
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon