Semi-online scheduling problems on a small number of machines
- First Online:
- Cite this article as:
- Lee, K. & Lim, K. J Sched (2013) 16: 461. doi:10.1007/s10951-013-0329-x
- 244 Downloads
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.