Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines

This paper aims at the problem of scheduling a set of jobs with arbitrary sizes on parallel batch processing machines with arbitrary capacities. The optimization objective is to minimize the total weighted completion time of jobs. After describing the studied problem, we analyze its complexity and present a lower bound of the problem. A heuristic is provided to solve the problem firstly. Then, with the proposed first job selection strategy based on the weights of jobs, two algorithms based on the ant system and the max-min ant system, respectively, are designed to address the problem. Through extensive experiments, the performance of the proposed algorithms is compared with several state-of-the-art algorithms. The comparative results verify effectiveness and efficiency of the proposed algorithms. (C) 2020 Elsevier Ltd. All rights reserved.