1. Baker, K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974), 305 pp.
2. Baptiste, P.: Scheduling equal-length jobs on identical parallel machines. Discrete Appl. Math. 103(1), 21–32 (2000)
3. Bouma, H.W., Goldengorin, B.: A polytime algorithm based on a primal LP model for the scheduling problem 1|pmtn;p
j
=2;r
j
|∑w
j
C
j
. Proceedings of the 2010 American Conference on Applied Mathematics, AMERICAN-MATH’10, Stevens Point, Wisconsin, USA, pp. 415–420. World Scientific and Engineering Academy and Society (WSEAS) (2010)
4. Brucker, P., Kravchenko, S.A.: Scheduling jobs with equal processing times and time windows on identical parallel machines. J. Sched. 11, 229–237 (2008)
5. Goemans, M.X., Wein, J.M., Williamson, D.P.: A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Oper. Res. Lett. 26, 149–154 (2000)