LAUSR

This paper studies the bounded parallel-batching scheduling problem considering job rejection, deteriorating jobs, setup time, and non-identical job sizes. Each job will be either rejected with a certain penalty cost, or accepted and further processed in batches on a single machine. There is a setup time before processing each batch, and the objective is to minimize the sum of the makespan and the total penalty. Several useful preliminaries for arranging accepted job with identical size are proposed. Based on these preliminaries, we first investigate a special case where all the jobs are considered to have the identical size, and develop a dynamic programming algorithm to solve it. The preliminaries help to reduce the complexity of the dynamic programming algorithm from $$ O\left( {n!n^{2} \sum\nolimits_{i = 1}^{n} {w_{j} } } \right) $$ O n ! n 2 ∑ i = 1 n w j to $$ O\left( {n^{2} \sum\nolimits_{i = 1}^{n} {w_{j} } } \right) $$ O n 2 ∑ i = 1 n w j . For the general problem with non-identical job sizes, we propose a hybrid algorithm combining heuristic with dynamic programming algorithm (H-DP) to obtain satisfactory solutions within reasonable time. Finally, the effectiveness and efficiency of the H-DP algorithm are illustrated by a series of computational experiments.