We study the problem of minimizing makespan for part machining on a multi-spindle heads machine with a mobile table. We show that this problem can be formulated as a scheduling problem for a single batch machine with compatibility and precedence constraints between jobs. Jobs grouped in a batch are processed simultaneously, but the difference from considered in the literature max-batch machine lies in the fact that batch processing time can exceed the time of the longest job of the batch. It depends on the batch content, i.e. which jobs constitute the batch. The scheduling problem is transformed into a problem of finding the constrained shortest path problem in specially constructed digraph. An industrial example is presented.