Author:
Chernykh K. A.,Servakh V. V.
Publisher
Springer International Publishing
Reference15 articles.
1. Pinedo, M.L.: Scheduling. Theory, Algorithms, and Systems, 3rd edn. Springer, Heidelberg (2008). 671p
2. Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343–362 (1977)
3. Labetoulle, J., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Preemptive scheduling of uniform machines subject to release dates. In: Progress in combinatorial optimization (Waterloo, Ont., 1982), pp. 245–261. Academic Press, Toronto, Ont. (1984)
4. Baptiste, P.: Scheduling equal-length jobs on identical parallel machines. Discrete Appl. Math. 103(1), 21–32 (2000)
5. Baptiste, Ph., Carlier, J., Kononov, A., Queyranne, M., Sevastianov, S., Sviridenko, M.: Structural properties of preemptive schedules. Discrete Anal. Oper. Res. 16(1), 3–36 (2009). (in Russian)