A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem  

作　　者：Deming Lei Heen Li 

机构地区：[1]College of Automation,Wuhan University of Technology,Wuhan,430070,China

出　　处：《Computers, Materials & Continua》2024年第5期1855-1874,共20页计算机、材料和连续体（英文）

基　　金：the National Natural Science Foundation of China(Grant Number 61573264).

摘　　要：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 formoulding.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 aremaintained throughout the search process.Two types of assimilations are achieved:The strongest and weakest empires cooperate in their assimilation,while the remaining two empires,having a close normalization total cost,combine in their assimilation.A new form of imperialist competition is proposed to prevent insufficient competition,and the unique features of the problem are effectively utilized.Computational experiments are conducted across several instances,and a significant amount of experimental results show that the newstrategies of CICAare effective,indicating promising advantages for the considered BPMscheduling problems.

关 键 词：Release time ASSIMILATION imperialist competitive algorithm batch processing machines scheduling 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]