International Journal of Soft Computing

120
Views

1
Downloads

The Total Completion Time: An Important Performance Measure in Scheduling

E.O. Oyetunji and A.E. Oluleye
Page: 407-411 | 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

Given the problem of scheduling n jobs with release dates on a single machine, we prove that any solution method that minimizes the total completion time (C_tot) also minimizes total flow time (F_tot), total lateness (L_tot), average completion time (C_avg), average flow time (F_avg) and average lateness (L_avg). Two approaches (Analytical and Experimental approaches) were adopted to prove this conjecture.

How to cite this article:

E.O. Oyetunji and A.E. Oluleye . The Total Completion Time: An Important Performance Measure in Scheduling.
DOI: https://doi.org/10.36478/ijscomp.2008.407.411
URL: https://www.makhillpublications.co/view-article/1816-9503/ijscomp.2008.407.411