Improved approximation algorthims for scheduling with release dates
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
Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithms for provisioning virtual private networks in the hose model
IEEE/ACM Transactions on Networking (TON)
Data migration to minimize the average completion time
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Computers and Operations Research
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
Data migration to minimize the total completion time
Journal of Algorithms
Improved results for data migration and open shop scheduling
ACM Transactions on Algorithms (TALG)
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Theoretical Computer Science - Approximation and online algorithms
Scheduling orders for multiple product types to minimize total weighted completion time
Discrete Applied Mathematics
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
INFORMS Journal on Computing
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
Equivalence of permutation polytopes corresponding to strictly supermodular functions
Discrete Applied Mathematics
Encouraging Cooperation in Sharing Supermodular Costs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Mixed integer programming formulations for single machine scheduling problems
Computers and Industrial Engineering
Approximation and Online Algorithms
Sequencing unreliable jobs on parallel machines
Journal of Scheduling
Proceedings of the forty-first annual ACM symposium on Theory of computing
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Information Processing Letters
A family of inequalities valid for the robust single machine scheduling polyhedron
Computers and Operations Research
Computers and Industrial Engineering
Order scheduling models: hardness and algorithms
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Operations Research
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Proceedings of the twenty-seventh annual symposium on Computational geometry
Constructing extended formulations from reflection relations
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
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
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
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Scheduling of uniform parallel machines with s-precedence constraints
Mathematical and Computer Modelling: An International Journal
Minimizing the sum of weighted completion times in a concurrent open shop
Operations Research Letters
An alternative proof of the Kawaguchi-Kyan bound for the Largest-Ratio-First rule
Operations Research Letters
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters
Operations Research Letters
Two dimensional optimal mechanism design for a sequencing problem
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.01 |