Paper Info
Title
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem.
Abstract
We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival times, arbitrary job deadlines, and unit job execution time. For this problem, we present a lower bound 2.09 on the competitive factor of any online algorithms, followed by designing a 5.2-competitive online algorithm. We would also like to point out a false claim made in an existing paper of Shi and Ye regarding a further restricted case of the considered problem. To the best of our knowledge, what we present is the first concrete result concerning online machine-minimizing job scheduling with arbitrary job arrival times and deadlines.
Year
DOI
Venue
2012
10.1007/978-3-642-35261-4_11
ALGORITHMS AND COMPUTATION, ISAAC 2012
DocType
Volume
ISSN
Conference
7676
0302-9743
Citations 
PageRank 
References 
4
0.51
14
Authors
4
Name
Order
Citations
PageRank
Mong-jen Kao1267.82
Jian-Jia Chen22007129.20
Ignaz Rutter331544.45
Dorothea Wagner42362221.67