On the performance of on-line algorithms for partition problems
Acta Cybernetica
An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling
SIAM Journal on Computing
A better lower bound for on-line scheduling
Information Processing Letters
New algorithms for an ancient scheduling problem
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A better algorithm for an ancient scheduling problem
Journal of Algorithms
Better Bounds for Online Scheduling
SIAM Journal on Computing
Theoretical Computer Science
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks
Journal of Scheduling
Semi-on-line multiprocessor scheduling with given total processing time
Theoretical Computer Science
Semi on-line scheduling on three processors with known sum of the tasks
Journal of Scheduling
Semi-online scheduling revisited
Theoretical Computer Science
New lower and upper bounds for on-line scheduling
Operations Research Letters
Semi on-line algorithms for the partition problem
Operations Research Letters
Semi-on-line problems on two identical machines with combined partial information
Operations Research Letters
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 | 0.00 |
We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a priori information: the total processing time, the largest processing time, the combination of the previous two or the optimal makespan. We propose a new algorithm that can be applied to the problem with the known total or largest processing time and prove that it has improved competitive ratios for the cases with a small number of machines. Improved lower bounds of the competitive ratio are also provided by presenting adversary lower bound examples.