FORM SIMILARITIES OF THE CON AND SILK DUE-DATE DETERMINATION METHODS

The optimal due date determination and sequencing problem of n jobs, o n a single machine, with deterministic processing times is reviewed. A n algorithm, using the SLK method, has been previously described by th e authors, by means of which. one optimal sequence as well as all the alternative optima are determined without resorting to the Complementa ry Pair and Exchange Principle concepts. In this paper, a similar algo rithm using the CON method is proposed, the optimization criterion bei ng the minimization of the total lateness penalty. It is shown that bo th algorithms lead to the same minimum value of the objective function . It is also shown that ail the alternative optima of either method ma y be determined, if those optima derived from the other method are kno wn.