Deming Lei*, Heen Li
CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 1855-1874, 2024, DOI:10.32604/cmc.2024.049480
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 >
Login
Register
