Scheduling unrelated batch processing machines with non-identical job sizes and unequal release times. The objective is to minimize makespan. Deterministic heuristics are proposed. According to computational experiments, one of the heuristics outperformed the others.