Boudhar, Mourad - In: Mathematical Methods of Operations Research 57 (2003) 3, pp. 513-527
We consider the problem of minimizing the makespan on a batch processing machine, in which jobs are not all compatible. Only compatible jobs can be included into the same batch. This relation of compatibility is represented by a graph (called compatibility graph), which is assumed to be...
