Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Lower bounds for SRPT-subsequence algorithms for nonpreemptive scheduling
Proceedings of the tenth 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
On-line single-server dial-a-ride problems
Theoretical Computer Science
Lower Bounds for On-Line Single-Machine Scheduling
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts
ESA '02 Proceedings of the 10th 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
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
The One-Machine Problem with Earliness and Tardiness Penalties
Journal of Scheduling
Minimizing total flow time in single machine environment with release time: an experimental analysis
Computers and Industrial Engineering
Minimizing the total completion time on-line on a single machine, using restarts
Journal of Algorithms
An exact method for Pm/sds,ri/Σi=1nCi problem
Computers and Operations Research
Computers and Operations Research
On-line scheduling of parallel machines to minimize total completion times
Computers and Operations Research
Optimally competitive list batching
Theoretical Computer Science
Online market driven spectrum scheduling and auction
Proceedings of the 2009 ACM workshop on Cognitive radio networks
SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Minimizing the total completion time on-line on a single machine, using restarts
Journal of Algorithms
SRPT is 1.86-competitive for completion time scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
TOFU: semi-truthful online frequency allocation mechanism for wireless network
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |