Use of variable range on solving multiple criteria scheduling problems

This paper proposes a general strategy for finding the efficient schedules in a multiple criteria scheduling problem. This flexible and powerful strategy, called the variable range technique, can be incorporated into many existing algorithms for finding efficient schedules. In particular, three such incorporations are studied. Computational results show that the improvement of using this technique in existing algorithms is substantial.