Asian Journal of Information Technology

150
Views

1
Downloads

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

E.O. Oyetunji and A.E. Oluleye
Page: 157-161 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

Abstract

In this study, the single machine bicriteria scheduling problem of hierarchically minimizing the total completion time of jobs (C_tot) 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 . Hierarchical Minimization of Total Completion Time and Number of Tardy Jobs Criteria.
DOI: https://doi.org/10.36478/ajit.2008.157.161
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2008.157.161