Author(s)

Limin Wang¹, Rongheng Li¹, Yunxia Zhou²

¹Key Laboratory of Computing and Stochastic Mathematics (Ministry of Education), Department of Mathematics, School of Mathematics and Statistics, Hunan Normal University, Changsha, China.
²College of Information Science and Engineering, Hunan Normal University, Changsha, China.

Ordinal online schedule for jobs with similar sizes in on two parallel machines system is considered. Firstly it is proved that the worst case performance ratio of the existing algorithm P₂ cannot be improved even if the job processing times are known in for any . Then a better algorithm named S is developed and its worst case performance ratio is given for  .

Semi-Online Scheduling, P_m Algorithm, S Algorithm, Worst Performance Ratio

Wang, L. , Li, R. and Zhou, Y. (2019) Better Algorithm of Ordinal Online Schedule for Jobs with Similar Sizes on Two Machines. American Journal of Operations Research, 9, 235-243. doi: 10.4236/ajor.2019.95015.