Sequencing heuristic for bicriteria scheduling in a single machine problem

Abstract

This paper considers the problem of minimizing the maximum tardiness and the variance of completion times on a single machine.Aheuristic is developed to find the optimal schedule for a linear objective function of two criteria by generating only a small set of the efficient schedules. The proposed heuristic is useful to a decision maker since he or she can easily select an optimal schedule from the small set of efficient schedules. A numerical example is given to illustrate the presented heuristic. Computation results are provided to demonstrate the effectiveness of the heuristic.