Pseudo lower bounds for online parallel machine scheduling

We present pseudo lower bounds for the online scheduling problems on parallel and identical machines, which is the infimum of the competitive ratio of an online algorithm that can be proved by using three lower bounds on the optimum makespan. Pseudo lower bounds for fixed mm machines, which match the competitive ratio of the current best algorithm when m=4,5,6m=4,5,6, are obtained in this paper.