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 >

Chia-Nan Wang¹, Glen Andrew Porter², Ching-Chien Huang^3,*, Viet Tinh Nguyen⁴, Syed Tam Husain⁴

CMC-Computers, Materials & Continua, Vol.70, No.2, pp. 3031-3048, 2022, DOI:10.32604/cmc.2022.020222 - 27 September 2021

Abstract Planning and scheduling is one of the most important activity in supply chain operation management. Over the years, there have been multiple researches regarding planning and scheduling which are applied to improve a variety of supply chains. This includes two commonly used methods which are mathematical programming models and heuristics algorithms. Flowshop manufacturing systems are seen normally in industrial environments but few have considered certain constraints such as transportation capacity and transportation time within their supply chain. A two-stage flowshop of a single processing machine and a batch processing machine are considered with their capacity… More >