Online scheduling with general machine cost functions

Authors:
Cs. Imreh
Affiliations:
Department of Informatics, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 10
Cited 3

On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An online scheduling algorithm for a two layer multiprocessor architecture

Acta Cybernetica
On-line Load Balancing for Related Machines

WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
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
Semi-online scheduling with machine cost

Journal of Computer Science and Technology
Scheduling problems on two sets of identical machines

Computing
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 machine cost and rejection

Discrete Applied Mathematics

New upper and lower bounds for online scheduling with machine cost

Discrete Optimization
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

For most scheduling problems the set of machines is fixed initially and remains unchanged for the duration of the problem. Recently online scheduling problems have been investigated with the modification that initially the algorithm possesses no machines, but that at any point additional machines may be purchased. In all of these models the assumption has been made that each machine has unit cost. In this paper we consider the problem with general machine cost functions. Furthermore we also consider a more general version of the problem where the available machines have speed, the algorithm may purchase machines with speed 1 and machines with speed s. We define and analyze some algorithms for the solution of these problems and their special cases. Moreover we prove some lower bounds on the possible competitive ratios.