Makespan minimization in job shops: a polynomial time approximation scheme
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
A polynomial approximation scheme for problem F2/rj/Cmax
Operations Research Letters
A linear time approximation scheme for makespan minimization in an open shop with release dates
Operations Research Letters
| Hi-index | 0.00 |