Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Structure of a simple scheduling polyhedron
Mathematical Programming: Series A and B
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Supermodular Relaxation for Scheduling with Release Dates
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Improved Scheduling Algorithms for Minsum Criteria
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Lower Bounds for On-Line Single-Machine Scheduling
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Implementation of a PTAS for Scheduling with Release Dates
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Convex Quadratic Programming Relaxations for Network Scheduling Problems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Lower bounds for on-line single-machine scheduling
Theoretical Computer Science
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Minimizing Sum of Completion Times and Makespan in Master-Slave Systems
IEEE Transactions on Computers
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
Theoretical Computer Science - Approximation and online algorithms
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
INFORMS Journal on Computing
Online Scheduling with Known Arrival Times
Mathematics of Operations Research
Quality-aware segment transmission scheduling in peer-to-peer streaming systems
MMSys '10 Proceedings of the first annual ACM SIGMM conference on Multimedia systems
Information Processing Letters
LP-based online scheduling: from single to parallel machines
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Better algorithms for minimizing average flow-time on related machines
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Efficient algorithms for average completion time scheduling
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Competitive analysis of preemptive single-machine scheduling
Operations Research Letters
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
Operations Research Letters
| Hi-index | 0.01 |