Optimization algorithms for a class of single machine scheduling problems using due date determination methods

Optimization algorithms for a class of single machine scheduling problems using due date determination methods

0.00 Avg rating0 Votes
Article ID: iaor1997103
Country: Serbia
Volume: 5
Start Page Number: 289
End Page Number: 297
Publication Date: Sep 1995
Journal: Yugoslav Journal of Operations Research
Authors: ,
Keywords: optimization
Abstract:

The problem of determining optimal schedules for the static, single machine scheduling problem with the aid of CON and SLK due date determination methods is considered. The objective is to minimize the total weighted earliness and tardiness penalty in the case when weights are proportional to the processing times of the respective jobs. For each method, an optimization algorithm has been developed, by means of which the set of all optimal sequences is provided. The numerical example, presented after the theoretical foundation, confirms considerations about the structural similarity of the two methods.

Reviews

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