All Title Author
Keywords Abstract


Hierarchical Minimization of Total Completion Time and Number of Tardy Jobs Criteria

Full-Text   Cite this paper   Add to My Lib

Abstract:

In this study, the single machine bicriteria scheduling problem of hierarchically minimizing the total completion time of jobs (Ctot) and number of tardy jobs (NT) with release time was explored. Two types of hierarchical minimization models (the case of the total completion time criterion being more important than the number of tardy jobs criterion and the case of the number of tardy jobs criterion being more important than the total completion time criterion) were discussed. Three heuristics (HR4, HR5 and HR6) selected from the literature were used to test the models.

Full-Text

comments powered by Disqus