International Journal of
Information and Education Technology

Abstract

Bi- or multi-objective scheduling problem is important in practice because it offers two and more managerial indicators simultaneously for decision-makers doing some trade-offs. To date the studies of single batch-processing machine problems with bi-criteria were relatively few compared to the single unit-processing machine. In this paper, we consider a bi-criteria scheduling problem of minimizing the makespan and total weighted tardiness on a single batch-processing machine. An exhausted enumeration approach is provided to find all Pareto-optimal solutions for small-scale problems. In addition, an alternative method called SA-based multi-objective (SAMO) algorithm is also developed for comparison with the exhausted enumeration approach. Computational results revealed that the proposed SAMO algorithm could almost find all Pareto-optimal solutions for the small problem. Obviously, the success on small-scale problems suggests the readiness of the proposed SA for large-scale problems.