Theoretical Computer Science
Semi-on-line multiprocessor scheduling with given total processing time
Theoretical Computer Science
The exact LPT-bound for maximizing the minimum completion time
Operations Research Letters
Semi on-line algorithms for the partition problem
Operations Research Letters
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Operations Research Letters
Semi-online scheduling with decreasing job sizes
Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information
Operations Research Letters
Max-min online allocations with a reordering buffer
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Optimal semi-online scheduling algorithms on a small number of machines
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| Hi-index | 5.23 |
This paper investigates the semi-online machine covering problems on m=3 parallel identical machines. Three different semi-online versions are studied and optimal algorithms are proposed. We prove that if the total processing time of all jobs or the largest processing time of all jobs is known in advance, the competitive ratios of the optimal algorithms are both m-1. If the total processing time and the largest processing time of all jobs are both known in advance, the competitive ratios of the optimal algorithms are 32 when m=3, and m-2 when m=4.