Evaluating Solution Methods to Bicriteria Scheduling Problems

This paper considers the scheduling problem of minimizing two criteria (bi criteria) at a time. The challenge of how to evaluate solution methods for bicriteria problems was first addressed. Then, two important issues of skewness (arising when the values of one criterion is a multiple of the other) and dimensional conflict (arising when the two criteria are not of the same unit) were tackled through a proposed normalization procedure. The methodology for determining the minimum and maximum possible values of the two criteria was also demonstrated.