Jackson's rule for single-machine scheduling: making a good heuristic better
Mathematics of Operations Research
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing
On some geometric methods in scheduling theory: a survey
Discrete Applied Mathematics
Better approximation guarantees for job-shop scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Near-Optimal Sequencing with Precedence Constraints
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
Approximability of flow shop scheduling
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
New and improved algorithms for minsum shop scheduling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Randomized Algorithm for Flow Shop Scheduling
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Grouping Techniques for Scheduling Problems: Simpler and Faster
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms
A fluid approach to large volume job shop scheduling
Journal of Scheduling
Scheduling on unrelated machines under tree-like precedence constraints
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Inapproximability results for no-wait job shop scheduling
Operations Research Letters
Hi-index | 0.00 |