A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem

Abstract
Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported.

This publication has 11 references indexed in Scilit: