Scheduling a set of jobs with arbitrary job sizes and release times on a set of P-batch machines with non-identical capacities is considered.
The objective is to minimize the makespan.
Two ACO-based meta-heuristics are proposed to solve the problem.
The heuristics are evaluated against a lower bound and with each other by computational experiments.