Heuristics for Minimizing Total Completion Time on Single Machine with Release Time
This paper focuses on the problem of scheduling n jobs with release dates on a single machine in order to minimize the total completion time. Since the problem has been characterized as strongly NP-hard, two heuristics (HR1 and AEO) were proposed for solving the problem in polynomial time. The heuristics were compared with the best approximation algorithm for this problem to date (Best-alpha). Experimental results show that AEO performed better than the Bestalpha algorithm (selected from the literature) when the number of jobs (n) exceeds 5. This observation should prove useful in the operational dispatch of jobs in industrial production settings as well as the service sector.
Prof. A.O. Akii Ibhadode
E. Oyetunji and A. E. Oluleye, "Heuristics for Minimizing Total Completion Time on Single Machine with Release Time ", Advanced Materials Research, Vols. 18-19, pp. 347-352, 2007