A study of scalar compilation techniques for pipelined supercomputers
ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
Minimizing mean flow time with release time constraint
Theoretical Computer Science
Scheduling chain-structured tasks to minimize makespan and mean flow time
Information and Computation
Ordering problems approximated: single-processor scheduling and interval graph completion
Proceedings of the 18th international colloquium on Automata, languages and programming
Profile-driven instruction level parallel scheduling with application to super blocks
Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture
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
Postpass Code Optimization of Pipeline Constraints
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimal On-Line Algorithms for Single-Machine Scheduling
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
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
Improved approximation algorthims for scheduling with release dates
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
Minimizing weighted completion time on a single machine
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A guessing game and randomized online algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Implementation of a PTAS for Scheduling with Release Dates
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Techniques for Scheduling with Rejection
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
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
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Journal of Global Optimization
On the definition of "on-line" in job scheduling problems
ACM SIGACT News
Minimizing the total completion time on-line on a single machine, using restarts
Journal of Algorithms
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
ACM Transactions on Algorithms (TALG)
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
Minimizing the total completion time on-line on a single machine, using restarts
Journal of Algorithms
Provably efficient two-level adaptive scheduling
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Operations Research Letters
Randomized algorithms for on-line scheduling problems: how low can't you go?
Operations Research Letters
Scheduling of variable-time jobs for distributed systems with heterogeneous processor cardinality
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |