TITLE:
Better Algorithm of Ordinal Online Schedule for Jobs with Similar Sizes on Two Machines
AUTHORS:
Limin Wang, Rongheng Li, Yunxia Zhou
KEYWORDS:
Semi-Online Scheduling, Pm Algorithm, S Algorithm, Worst Performance Ratio
JOURNAL NAME:
American Journal of Operations Research,
Vol.9 No.5,
September
20,
2019
ABSTRACT: 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 P2 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 .