Minimizing total completion time for UET tasks with release time and outtree precedence constraints

2005 ◽  
Vol 62 (2) ◽  
pp. 275-279 ◽  
Author(s):  
Yumei Huo ◽  
Joseph Y. -T. Leung
Keyword(s):  
Completion Time ◽  
Precedence Constraints ◽  
Total Completion Time ◽  
Release Time

Heuristics for Minimizing Total Completion Time on Single Machine with Release Time

2007 ◽  
Vol 18-19 ◽  
pp. 347-352 ◽  
Author(s):  
Elkanah Oyetunji ◽  
Ayodeji E. Oluleye
Keyword(s):  
Approximation Algorithm ◽  
Single Machine ◽  
Industrial Production ◽  
Completion Time ◽  
Service Sector ◽  
Total Completion Time ◽  
Release Time ◽  
Release Dates ◽  
The Best Approximation ◽  
Better Than

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.

Sign in / Sign up

Export Citation Format

Share Document