Minimizing total weighted completion time on a batch-processing machine with re-entrance

The single batch-processing machine scheduling problem with re-entrance to minimize total weighted completion time is considered, where the capacity of the machine is infinite and there are different processing types in the same machine. This problem can be transformed into a model with parallel chains precedence constraint. A polynomial time heuristic algorithm for the problem is given. Experimentation results show that the algorithm is efficient.