Zhang, L Q; Lu, L F; Ng, C T - In: Journal of the Operational Research Society 63 (2012) 3, pp. 293-298
In this paper, we consider the unbounded parallel-batch scheduling with rejection. A job is either rejected, in which case a certain penalty has to be paid, or accepted and processed in batches on a machine. The processing time of a batch is defined as the longest processing time of the jobs...