The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times is firstly delivered in this paper. For the problem of minimizing the makespan, we show an algorithm which of the worst-case performance ratio is where
