Scheduling on a batch machine with job compatibilities
Abstract
We consider the problem of minimizing the makespan on a single batch processing machine, in which jobs are not all compatible, i.e. there are at least two jobs that can not be processed simultaneously in the same batch. The capacity of the batch processing machine can befinite or infinite. The processing time of a batchis given by the processing time of the longest jobs in the batch. We prove NP-hardness of the general problem and present polynomial algorithms for several special cases.
Downloads
Published
2000-06-01
How to Cite
Boudhar, M., & Finke, G. (2000). Scheduling on a batch machine with job compatibilities. JORBEL - Belgian Journal of Operations Research, Statistics, and Computer Science, 40(1-2), 69–80. Retrieved from https://orbel.be/jorbel/index.php/jorbel/article/view/308
Issue
Section
Articles