Journal of Scheduling

, Volume 16, Issue 5, pp 461–477

Semi-online scheduling problems on a small number of machines


DOI: 10.1007/s10951-013-0329-x

Cite this article as:
Lee, K. & Lim, K. J Sched (2013) 16: 461. doi:10.1007/s10951-013-0329-x


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.


Semi-online scheduling Competitive ratio Lower bound example 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Supply Chain Management & Marketing SciencesRutgers Business SchoolNewarkUSA
  2. 2.BK21 ProjectSogang Business SchoolSeoulRepublic of Korea

Personalised recommendations