Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing mean flow time with release time constraint
Theoretical Computer Science
On multiprocessor system scheduling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Resource scheduling for parallel database and scientific applications
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Approximating total flow time on parallel machines
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Minimizing the flow time without migration
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A PTAS for minimizing the weighted sum of job completion times on parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth 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
Scheduling to minimize average stretch without migration
SODA '00 Proceedings of the eleventh 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
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation schemes for preemptive weighted flow time
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th 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
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Optimal Online Flow Time with Resource Augmentation
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The Online Dial-a-Ride Problem under Reasonable Load
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Lower bounds for on-line single-machine scheduling
Theoretical Computer Science
Average stretch without migration
Journal of Computer and System Sciences
Minimizing total flow time in single machine environment with release time: an experimental analysis
Computers and Industrial Engineering
Minimizing average flow time on related machines
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Optimal on-line flow time with resource augmentation
Discrete Applied Mathematics - Special issue: Efficient algorithms
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Approximating total flow time on parallel machines
Journal of Computer and System Sciences
ACM Transactions on Algorithms (TALG)
Weighted flow time does not admit O(1)-competitive algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the forty-first annual ACM symposium on Theory of computing
Optimal on-line flow time with resource augmentation
Discrete Applied Mathematics - Special issue: Efficient algorithms
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Quality-aware segment transmission scheduling in peer-to-peer streaming systems
MMSys '10 Proceedings of the first annual ACM SIGMM conference on Multimedia systems
Resource augmentation for weighted flow-time explained by dual fitting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters
On-line scheduling to minimize max flow time: an optimal preemptive algorithm
Operations Research Letters
Minimizing flow time on a constant number of machines with preemption
Operations Research Letters
| Hi-index | 0.00 |