TY  - JOUR
T1  - Heuristics for Minimizing Total Completion Time and Number of Tardy Jobs Simultaneously on Single Machine with Release Time
AU - , E.O. Oyetunji AU - , A.E. Oluleye 
JO  - Research Journal of Applied Sciences
VL  - 3
IS  - 2
SP  - 147
EP  - 152
PY  - 2008
DA  - 2001/08/19
SN  - 1815-932x
DO  - rjasci.2008.147.152
UR  - https://makhillpublications.co/view-article.php?doi=rjasci.2008.147.152
KW  - Single machine scheduling
KW  -simultaneous minimization
KW  -total completion time
KW  -number of tardy jobs
KW  -Heuristics
AB  - 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.
ER  -