An approach for solving single-machine bi-criteria scheduling problem

In this study, we develop an algorithm for a bi-criteria scheduling problem that minimizes the maximum weighted tardiness and total weighted flow time. While the algorithm is capable of generating all nondominated points, the algorithm is designed to generate a subset of the nondominated points that guarentee to represent the whole nondominated set based on a prespecified quality measure. We apply the algorithm on a wide variety of problems with different properties. The results of the experiments show that the algorithm works well not only in terms of the solution time but also the number of schedules presented to the decision maker.