Single Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost

摘要

In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certainjobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (I) minimization of the sum of weighted completion times for the acceptedjobs, and (2) minimization of the sum of penalties for the rejected jobs. The authors apply two-phase method (TPM), which is a general technique to solve bi-objective combinatorial optimization problems, to find all supported and non-supported solutions for small-sized problems. The authors present a mathematical model for implementing both phases. On the other hand, three different bi-objective simulated annealing algorithms have also been developed to find a good estimation ofPareto-optimal solutions for large-sized problems. Finally the authors discuss the results obtained from each of these algorithms.