Online scheduling with machine cost and rejection

Authors:
J. Nagy-György;Cs. Imreh
Affiliations:
Department of Mathematics, University of Szeged, Aradi vértanúk tere 1, H-6720 Szeged, Hungary;Department of Informatics, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 9
Cited 7

A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Multiprocessor Scheduling with Rejection

SIAM Journal on Discrete Mathematics
Preemptive multiprocessor scheduling with rejection

Theoretical Computer Science
Scheduling with Machine Cost

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Semi-online scheduling with machine cost

Journal of Computer Science and Technology
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

Algorithmica
Better Online Algorithms for Scheduling with Machine Cost

SIAM Journal on Computing
Preemptive online algorithms for scheduling with machine cost

Acta Informatica

Online scheduling with general machine cost functions

Discrete Applied Mathematics
Lorenz versus Pareto dominance in a single machine scheduling problem with rejection

EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
On variants of file caching

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
New upper and lower bounds for online scheduling with machine cost

Discrete Optimization
Single Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost

International Journal of Applied Evolutionary Computation
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.05

Visualization

Abstract

In this paper we define and investigate a new scheduling model. In this new model the number of machines is not fixed; the algorithm has to purchase the used machines, moreover the jobs can be rejected. We show that the simple combinations of the algorithms used in the area of scheduling with rejections and the area of scheduling with machine cost are not constant competitive. We present a 2.618-competitive algorithm called OPTCOPY.