1. Błażewicz, J., Ecker, K., Plateau, B., Trystram, D.: Handbook on Parallel and Distributed Processing. Springer-Verlag, Heidelberg (2000)
2. Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Sterna, M., Weglarz, J.: Handbook on Scheduling: From Theory to Practice. Springer, Cham (2019)
3. Błazewicz, J., Drabowski, M., Węglarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. C-35(5), 389–393 (1986)
4. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
5. Lee, C.Y.: Machine scheduling with availably constraints. In Leung, J.Y.T. (ed.) Handbook of Scheduling, pp. 22.1–22.13. CRC Press, Boca Raton (2004)