Bounded single-machine parallel-batch scheduling with release dates and rejection


We consider the bounded single-machine parallel-batch scheduling problem with release dates and rejection. A job is either rejected, in which case a certain penalty has to be paid, or accepted and then processed on the machine. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejected jobs. When the jobs… (More)
DOI: 10.1016/j.cor.2008.12.003


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics