This research was supported by the National Natural Science Foundation of China(Nos.11271356,and 71390334).
In this paper,we investigate online scheduling problems on two parallel identical machines under a grade of service provision with makespan as the objective function.The jobs arrive over time and each job can be sched...