The exact bound of Lee's MLPT

AbstractLee provided a modified version of LPT algorithm to deal with the problem Parallel Machines Scheduling with Nonsimultaneous Machine Available Times, and got an upper bound of built43 for its worst-case performance ratio. An open question is then proposed to obtain the exact value of this ratio, which is determined in this paper. The instance which achieves the ratio is also demonstrated