Optimal preemptive scheduling for general target functions

Authors:
Leah Epstein;Tamir Tassa
Affiliations:
Department of Mathematics, University of Haifa, 31905 Haifa, Israel;Department of Mathematics and of Computer Science, The Open University, Raanana, Israel
Venue:
Journal of Computer and System Sciences
Year:
2006

Citing 11
Cited 4

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Convex separable optimization is not much harder than linear optimization

Journal of the ACM (JACM)
A 13/12 approximation algorithm for bin packing with extendable bins

Information Processing Letters
Approximation algorithms for partitioning small items in unequal bins to minimize the total size

Proceedings of the third international conference on Graphs and optimization
A Level Algorithm for Preemptive Scheduling

Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
Approximation algorithms for extensible bin packing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Minimizing Makespan and Preemption Costs on a System of Uniform Machines

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal scheduling of independent tasks on heterogeneous computing systems

ACM '74 Proceedings of the 1974 annual conference - Volume 1

An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the lpNorm

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A Lower Bound for the On-Line Preemptive Machine Scheduling with lpNorm

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Preemptive scheduling on selfish machines

CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Robust algorithms for preemptive scheduling

ESA'11 Proceedings of the 19th European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

While there has been a significant amount of theoretical and empirical research on the multiple-instance learning model, most of this research is for concept learning. However, for the important application area of drug discovery, a real-valued classification ...