An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. The objective is to minimize the makespan. We provide an algorithm for the problem that is better than one given in the literature, improving the competitive ratio from 32 to 2.