Form similarities of the CON and SlK due date determination methods

Form similarities of the CON and SlK due date determination methods

0.00 Avg rating0 Votes
Article ID: iaor1996499
Country: United Kingdom
Volume: 46
Issue: 6
Start Page Number: 762
End Page Number: 770
Publication Date: Jun 1995
Journal: Journal of the Operational Research Society
Authors: ,
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.

Reviews

Required fields are marked *. Your email address will not be published.