摘要：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 .
关键词：Semi-Online SchedulingPm AlgorithmS AlgorithmWorst Performance Ratio
