Form Similarities of the CON and SLK Due Date Determination Methods

Abstract

The optimal due date determination and sequencing problem of n jobs, on a single machine, with deterministic processing times is reviewed. An algorithm, using the SLK method, has been previously described by the authors, by means of which one optimal sequence as well as all the alternative optima are determined without resorting to the Complementary Pair and Exchange Principle concepts. In this paper, a similar algorithm using the CON method is proposed, the optimization criterion being the minimization of the total lateness penalty. It is shown that both algorithms lead to the same minimum value of the objective function. It is also shown that all the alternative optima of either method may be determined, if those optima derived from the other method are known.