- Baker , K. R. and Su , Zaw-Sing . 1974 . “Sequencing with due dates and early start times to minimize maximum tardiness” . Naval Res. logist. Quart. , 21 : 171 – 177 .
- Bratley , P. , Florian , M. and Robillard , P. 1973 . “On sequencing with earliest start times and due-dates with application to computing bounds for (n/m/G/Fmax} problem,” . Naval Res. logist. Quart. , 20 : 57 – 67 .
- Carlier , J. 1982 . “The one-machine sequencing problem” . European J. of Operational Research , 11 : 42 – 47 .
- Garey , M. R. , Johnson , D. S. , Simons , B. B. and Tarjan , R. E. 1981 . “Scheduling unit-time tasks with arbitrary release times and deadlines” . SIAM J. Comput. , 10 : 256 – 269 .
- McMahon , G. and Florian , M. 1975 . “On scheduling with ready times and due dates to minimize maximum lateness” . Operations Research , 23 : 475 – 482 .
- Schrage , L. March 1971 . Obtaining optimal solutions to resource constrained network scheduling problems March , unpublished manuscript
- Simons , B. and Warmuth , M. 1989 . “A fast algorithm for multiprocessor scheduling of unit-length jobs” . SIAM J. Comput. , 18 : 690 – 710 .
International Journal of Computer Mathematics
Volume 79, 2002 - Issue 6