Cyclic transfer algorithm for single batching machine with total weighted completion time

n jobs, each job i with a minimum processing time p_i and a weight w_i, have to be processed on a batching machine with capacity B. Minimization of total weighted completion time for single batching machine is a classical scheduling problem. Dijkstra´s algorithm, the method to find the shortest path in a graph, is used to partition the jobs into batches. And it can get the optimal batches for a certain fixed sequence of the jobs for the batching machine. The batches also can be improved by the cyclic transfer algorithm that is the first time to be used to a batching machine. We give a comparison of the algorithms to the MRLC algorithm in the last part to prove the quality of the cyclic transfer algorithm. And the improvement of the cyclic transfer is over 1 percent.