Mingbo Li, Deming Lei^*

CMES-Computer Modeling in Engineering & Sciences, Vol.143, No.2, pp. 1789-1808, 2025, DOI:10.32604/cmes.2025.064886 - 30 May 2025

Abstract As a complicated optimization problem, parallel batch processing machines scheduling problem (PBPMSP) exists in many real-life manufacturing industries such as textiles and semiconductors. Machine eligibility means that at least one machine is not eligible for at least one job. PBPMSP and scheduling problems with machine eligibility are frequently considered; however, PBPMSP with machine eligibility is seldom explored. This study investigates PBPMSP with machine eligibility in fabric dyeing and presents a novel shuffled frog-leaping algorithm with competition (CSFLA) to minimize makespan. In CSFLA, the initial population is produced in a heuristic and random way, and the More >

Lianqiang Wu, Deming Lei^*, Yutong Cai

CMC-Computers, Materials & Continua, Vol.83, No.2, pp. 1771-1789, 2025, DOI:10.32604/cmc.2025.063944 - 16 April 2025

Abstract Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines (BPM). In this study, the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered, and an adaptive cooperated shuffled frog-leaping algorithm (ACSFLA) is proposed to minimize makespan and total tardiness simultaneously. ACSFLA determines the search times for each memeplex based on its quality, with more searches in high-quality memeplexes. An adaptive cooperated and diversified search mechanism is applied, dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality. During the… More >

Deming Lei^*, Heen Li

CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 1855-1874, 2024, DOI:10.32604/cmc.2024.049480 - 15 May 2024

Abstract This study focuses on the scheduling problem of unrelated parallel batch processing machines (BPM) with release times, a scenario derived from the moulding process in a foundry. In this process, a batch is initially formed, placed in a sandbox, and then the sandbox is positioned on a BPM for moulding. The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume. To minimize the makespan, a new cooperated imperialist competitive algorithm (CICA) is introduced. In CICA, the number of empires is not a parameter, and four empires are maintained More >