2Nessah R, Kacem ! . Branch-and-Bound Method fir Minimizing the Weighted Completion time Scheduling Problem on a Single Machine With Release Dates[J].omputers & Operations Research,2012,39 (2).
3Agnetis A, Pascale G, Pacciarelli D. A Lagrangian Approach to Sin- gle-Machine Scheduling Problem With two Competing Aents[J].Jour- nal of Scheduling,2009,(12).
4Lawler E L .A Dynamic Programming Algorithm for Preemptive Scheduling of A Single Machine to Minimize the Number of Late Jobs [J].Annals of Operations Research Volume, 1990,(26).
5Liu B .Uncertainty Theory .2nd ed[M].Berlin:Springer-Verlay,2007.
