We consider the online scheduling problems of three and four machines under eligibility constraint. Respectively for the cases of three and four machines, we prove that AW algorithm has competitive ratios of $frac{5}{2}$ and 3 which are shown to be optimal. Also, we show that the same results hold for the semi-online cases with prior knowledge of the total and the largest processing time.