Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision

► We consider a scheduling model under a grade of service provision. ► We consider two semi-online versions on two parallel identical machines. ► The objective is to minimize makespan. ► We give two optimal approximation algorithms for the two versions respectively.