Semi-online algorithms for scheduling with machine cost

Authors:
Yi-Wei Jiang;Yong He
Affiliations:
Faculty of Science, Zhejiang Sci-Tech University, Hangzhou, P.R. China and Department of Mathematics, Zhejiang University, Hangzhou, P.R. China;Department of Mathematics, Zhejiang University, Hangzhou, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2006

Citing 9
Cited 2

Semi on-line scheduling on two identical machines

Computing
A guessing game and randomized online algorithms

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines

Acta Informatica
Better Online Algorithms for Scheduling with Machine Cost

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

Acta Informatica
Semi-online algorithms for parallel machine scheduling problems

Computing
Semi on-line algorithms for the partition problem

Operations Research Letters

Competitive analysis of two special online device replacement problems

Journal of Computer Science and Technology
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

In this paper, we consider the following semi-online List Model problem with known total size. We are given a sequence of independent jobs with positive sizes, which must be assigned to be processed on machines. No machines are initially provided, and when a job is revealed the algorithm has the option to purchase new machines. By normalizing all job sizes and machine cost, we assume that the cost of purchasing one machine is 1. We further know the total size of all jobs in advance. The objective is to minimize the sum of the makespan and the number of machines to be purchased. Both non-preemptive and preemptive versions are considered. For the non-preemptive version, we present a new lower bound 6/5 which improves the known lower bound 1.161. For the preemptive version, we present an optimal semi-online algorithm with a competitive ratio of 1 in the case that the total size is not greater than 4, and an algorithm with a competitive ratio of 5/4 otherwise, while a lower bound 1.0957 is also presented for general case.