Research Journal of Applied Sciences
ISSN: Online 1993-6079ISSN: Print 1815-932x
Abstract
In this study, the problem of simultaneously minimizing the total completion time and number of tardy jobs with release dates on a single machine is investigated. Three heuristics (called HR4, HR5 and HR6) were proposed for the bicriteria problem and were compared with the branch and bound (BB) procedure in order to evaluate effectiveness. Computational experiments, focusing on both the effectiveness (a measure of the closeness of the value of the performance measure) and efficiency (a measure of the execution time or speed) of the solution methods, were presented.
How to cite this article:
E.O. Oyetunji and A.E. Oluleye . Heuristics for Minimizing Total Completion Time and Number of Tardy Jobs Simultaneously on Single Machine with Release Time.
DOI: https://doi.org/10.36478/rjasci.2008.147.152
URL: https://www.makhillpublications.co/view-article/1815-932x/rjasci.2008.147.152