Parallel batch scheduling with nested processing set restrictions

We study the problem of scheduling n jobs on m parallel batching machines with nested processing set restrictions. Each job has a release time before which it cannot be processed, and has a restricted set of batching machines to which it can be assigned, called its processing set. Two distinct processing sets are either nested or disjoint. Each batching machine can process up to B (B