This presentation concerns a new scheduling problem for machining lines. This problem can be formulated as scheduling for a single max-batch machine with inclusion, exclusion and precedence constraints between jobs and under the condition that the time of a batch can exceed the time of its longest job. This problem is solved using the constrained shortest path approach. Dominance properties were developed to decrease the digraph's size. An illustrative example is reported.