1. A. A. Lazarev, Scheduling Theory: Estimation of the Absolute Error and Scheme for Approximate Solution of Scheduling Problems (Mosk. Fiz.-Tekh. Inst., Moscow, 2008) [in Russian].
2. J. R. Jackson, “Scheduling a production line to minimize maximum tardiness,” Los Angeles, CA, University of California. Manag. Sci. Res. Project Res. Rep., No. 43 (1955).
3. B. B. Simons, “A fast algorithm for single processor scheduling,” The 19th Annual Symposium on Foundations of Computer Science(Ann Arbor, Mich., 1978), pp. 246–252.
4. N. Vakhania, “A binary search algorithm for a special case of minimizing the lateness on a single machine,” Int. J. Appl. Math. Inf. I.3, 45–50 (2009).
5. J. A. Hoogeven, “Minimizing maximum promptness and maximum lateness on a single machine,” Math. Operat. Res.
21, 100–114 (1996).