Asian Journal of Information Technology

Year: 2008
Volume: 7
Issue: 4
Page No. 157 - 161

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

Authors : E.O. Oyetunji and A.E. Oluleye

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.

How to cite this article:

E.O. Oyetunji and A.E. Oluleye , 2008. Hierarchical Minimization of Total Completion Time and Number of Tardy Jobs Criteria. Asian Journal of Information Technology, 7: 157-161.

Design and power by Medwell Web Development Team. © Medwell Publishing 2022 All Rights Reserved