We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest...