Scheduling with Machine Cost

Authors:
Csanád Imreh;John Noga
Affiliations:
-;-
Venue:
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Year:
1999

Citing 0
Cited 10

A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Buying a Constant Competitive Ratio for Paging

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Semi-online scheduling with machine cost

Journal of Computer Science and Technology
Online scheduling with machine cost and rejection

Discrete Applied Mathematics
Online scheduling with general machine cost functions

Discrete Applied Mathematics
Semi-online algorithms for scheduling with machine cost

Journal of Computer Science and Technology
New upper and lower bounds for online scheduling with machine cost

Discrete Optimization
Optimal semi-online algorithms for scheduling with machine activation cost

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
The generalization of scheduling with machine cost

Theoretical Computer Science
Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract