A Competitive Online Algorithm for Minimizing Total Weighted Completion Time on Uniform Machines

Table 2

Three types of instances with specified structure.

:	Any instance for which there does not exist a time between the earliest SPoint and the latest EPoint in the online schedule by the LW-SWPR rule, such that all the machines remain idle at
:	An instance which not only possesses the same structure as but also satisfies that each job has the same weighted processing time
:	An instance which not only possesses the same structure as but also satisfies that jobs in the last subqueue in the online schedule have the same weighted processing time with weights tending to positive infinity