TY  - JOUR
T1  - Hierarchical Minimization of Total Completion Time and Number of Tardy Jobs Criteria
AU - , E.O. Oyetunji AU - , A.E. Oluleye 
JO  - Asian Journal of Information Technology
VL  - 7
IS  - 4
SP  - 157
EP  - 161
PY  - 2008
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2008.157.161
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2008.157.161
KW  - Hierarchical minimization
KW  -heuristics
KW  -relative weight
KW  -composite objective function
KW  -single machine
AB  - In this study, the single machine bicriteria scheduling problem of hierarchically minimizing the total completion time of jobs (C<SUB>tot</SUB>) 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.
ER  -