Online bounded-batch scheduling to minimize total weighted completion time on parallel machines

We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines. In the problem, a set of n independent jobs arriving online over time has to be scheduled on m given machines, where the information of each job including its processing time and weight is not known in advance. Each machine can process up to b (b