Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Worst case bound of an LRF schedule for the mean weighted flow-time problem
SIAM Journal on Computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Formulating the single machine sequencing problem with release dates as a mixed integer program
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Single-machine scheduling polyhedra with precedence constraints
Mathematics of Operations Research
Ordering problems approximated: single-processor scheduling and interval graph completion
Proceedings of the 18th international colloquium on Automata, languages and programming
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A time indexed formulation of non-preemptive single machine scheduling problems
Mathematical Programming: Series A and B
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Scheduling Parallel Machines On-line
SIAM Journal on Computing
Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Task Scheduling in Networks (Extended Abstract)
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Scheduling Jobs that Arrive Over Time (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of 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
Profile-driven instruction level parallel scheduling with application to super blocks
Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth 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
SODA '97 Proceedings of the eighth 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
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
New and improved algorithms for minsum shop scheduling
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
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Scheduling Algorithms for the Broadcast Delivery of Digital Products
IEEE Transactions on Knowledge and Data Engineering
News from the Online Traveling Repairman
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
An Experimental Study of Online Scheduling Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Convex Quadratic Programming Relaxations for Network Scheduling Problems
ESA '99 Proceedings of the 7th 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
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
Minimizing total flow time and total completion time with immediate dispatching
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Energy management for battery-powered embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
An experimental study of online scheduling algorithms
Journal of Experimental Algorithmics (JEA)
The One-Machine Problem with Earliness and Tardiness Penalties
Journal of Scheduling
Average stretch without migration
Journal of Computer and System Sciences
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
MARS: A Metascheduler for Distributed Resources in Campus Grids
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Minimizing total flow time in single machine environment with release time: an experimental analysis
Computers and Industrial Engineering
Teaching the power of randomization using a simple game
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Approximating earliest arrival flows with flow-dependent transit times
Discrete Applied Mathematics
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
INFORMS Journal on Computing
Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
EURASIP Journal on Applied Signal Processing
Development of scheduling strategies with Genetic Fuzzy systems
Applied Soft Computing
Improved bounds for scheduling conflicting jobs with minsum criteria
ACM Transactions on Algorithms (TALG)
Scalable dimensioning of resilient Lambda Grids
Future Generation Computer Systems
Heat treatment for bearings: scheduling strategies and distributed decision support system
ICS'05 Proceedings of the 9th WSEAS International Conference on Systems
INFORM: integrated flow orchestration and meta-scheduling for managed grid systems
Proceedings of the 2007 ACM/IFIP/USENIX international conference on Middleware companion
Resource scheduling with variable requirements over time
Journal of Scheduling
Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
Computers and Operations Research
Approximation and Online Algorithms
Tight Bounds for Permutation Flow Shop Scheduling
Mathematics of Operations Research
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved results for scheduling batched parallel jobs by using a generalized analysis framework
Journal of Parallel and Distributed Computing
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Provably efficient two-level adaptive scheduling
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Tight bounds for permutation flow shop scheduling
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
DECO: data replication and execution CO-scheduling for utility grids
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
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
List scheduling in order of α-points on a single machine
Efficient Approximation and Online Algorithms
Scheduling of variable-time jobs for distributed systems with heterogeneous processor cardinality
International Journal of Ad Hoc and Ubiquitous Computing
A framework for scheduling with online availability
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Information Sciences: an International Journal
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
Computers and Operations Research
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |