Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
SIAM Journal on Computing
Improved approximation algorthims for scheduling with release dates
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Optimal On-Line Algorithms for Single-Machine Scheduling
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
The problem of scheduling jobs with release dates on a single machine so as to minimize total completion time has long been know to be strongly NP-complete. Recently, a polynomial-time approximation scheme (PTAS) was found for this problem. We implemented this algorithm to compare its performance with several other known algorithms for this problem. We also developed several good algorithms based on this PTAS that run faster by sacrificing the performance guarantee. Our results indicate that the ideas used by this PTAS lead to improved algorithms.