Pseudo lower bounds for online parallel machine scheduling》.pdf

Operations Research Letters 43 (2015) 489–494 Contents lists available at ScienceDirect Operations Research Letters journal homepage: /locate/orl Pseudo lower bounds for online parallel machine scheduling Zhiyi Tan ∗, Rongqi Li Department of Mathematics, Zhejiang University, Hangzhou 310027, PR China a r t i c l e i n f o a b s t r a c t Article history: We present pseudo lower bounds for the online scheduling problems on parallel and identical machines, Received 6 December 2014 which is the infimum of the competitive ratio of an online algorithm that can be proved by using three Received in revised form lower bounds on the optimum makespan. Pseudo lower bounds for fixed m machines, which match the 7 July 2015 competitive ratio of the current best algorithm when m = 4, 5, 6, are obtained in this paper. Accepted 8 July 2015 © 2015 Elsevier B.V. All rights reserved. Available online 15 July 2015 Keywords: Scheduling Online Competitive ratio Lower bound 1. Introduction the optimal algorithm when m ≥ 4. From then on, algorithms and lower bounds have been refined bit by bit. The current best In this paper we consider classical online scheduling problems algorithm with competitive ratio 1 +  1+ln 2 ≈ 1.9201 was given on parallel and identical machines. We are given a sequence J =