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
An experimental study of LP-based approximation algorithms for scheduling problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation in stochastic scheduling: the power of LP-based priority policies
Journal of the ACM (JACM)
New and improved algorithms for minsum shop scheduling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Bicriteria approximation algorithms for scheduling problems with communications delays
Journal of Scheduling
A new average case analysis for completion time scheduling
Journal of the ACM (JACM)
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
Dynamic rule-ordering optimization for high-speed firewall filtering
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems
IEEE Transactions on Computers
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
INFORMS Journal on Computing
Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Single machine precedence constrained scheduling is a vertex cover problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Distributed order scheduling and its application to multi-core dram controllers
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A Global Constraint for Total Weighted Completion Time
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Scheduling with Precedence Constraints of Low Fractional Dimension
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Approximating Single Machine Scheduling with Scenarios
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Computers and Operations Research
Proceedings of the forty-first annual ACM symposium on Theory of computing
Order scheduling models: hardness and algorithms
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
Vertex cover in graphs with locally few colors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
ALPS: a software framework for parallel space-time adaptive processing
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Approximating precedence-constrained single machine scheduling by coloring
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Combinatorial algorithms for data migration to minimize average completion time
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Minimizing the sum of weighted completion times in a concurrent open shop
Operations Research Letters
A note on weighted completion time minimization in a flexible flow shop
Operations Research Letters
Vertex cover in graphs with locally few colors
Information and Computation
Single machine scheduling with scenarios
Theoretical Computer Science
| Hi-index | 0.00 |