Minimizing mean flow time with release time constraint
Theoretical Computer Science
Approximability and nonapproximability results for minimizing total flow time on a single machine
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Efficiently sequencing tape-resident jobs
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Analysis of first-come-first-serve parallel job scheduling
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
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
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
Improved algorithms for stretch scheduling
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Non-approximability Results for Scheduling Problems with Minsum Criteria
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Accommodating Function - A Generalization of the Competitive Ratio
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Maximizing job benefits on-line
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Online Weighted Flow Time and Deadline Scheduling
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Scheduling Broadcasts in Wireless Networks
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
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
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Minimizing flow time nonclairvoyantly
Journal of the ACM (JACM)
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Non-clairvoyant scheduling for weighted flow time
Information Processing Letters
Approximation Algorithms for Average Stretch Scheduling
Journal of Scheduling
Average stretch without migration
Journal of Computer and System Sciences
SRPT optimally utilizes faster machines to minimize flow time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On minimizing the total flow time on multiple machines
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Dynamic TCP acknowledgment in the LogP model
Journal of Algorithms
SPT is optimally competitive for uniprocessor flow
Information Processing Letters
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Journal of the ACM (JACM)
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Minimizing total flow time in single machine environment with release time: an experimental analysis
Computers and Industrial Engineering
On the definition of "on-line" in job scheduling problems
ACM SIGACT News
Three dozen papers on online algorithms
ACM SIGACT News
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Theoretical Computer Science
An exact method for Pm/sds,ri/Σi=1nCi problem
Computers and Operations Research
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research
Approximating total flow time on parallel machines
Journal of Computer and System Sciences
ACM Transactions on Algorithms (TALG)
Competitive non-migratory scheduling for flow time and energy
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
SRPT optimally utilizes faster machines to minimize flow time
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
Minimizing Average Flow Time on Unrelated Machines
Approximation and Online Algorithms
Proceedings of the forty-first annual ACM symposium on Theory of computing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
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
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
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
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the value of preemption in scheduling
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
A simpler proof of preemptive total flow time approximation on parallel machines
Efficient Approximation and Online Algorithms
Greedy multiprocessor server scheduling
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
Providing performance guarantees in multipass network processors
IEEE/ACM Transactions on Networking (TON)
FIFO queueing policies for packets with heterogeneous processing
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Cloud scheduling with setup cost
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Joint optimization of overlapping phases in MapReduce
Performance Evaluation
| Hi-index | 0.00 |