1. Ahuja, R. (1985). Minimax linear programming problem. Operations Research Letters, 4(3), 131–134.
2. Allahverdi, A., & Al-Anzi, F. S. (2002). Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for www applications. Computers & Operations Research, 29(8), 971–994.
3. Bárány, I., & Fiala, T. (1982). Többgépes ütemezési problémák közel optimális megoldása (in Hungarian). Szigma - Matematikai - Közgazdasági Folyóirat, 15, 177–191.
4. Chen, B., Potts, C. N., & Woeginger, G. J. (1999). A review of machine scheduling: Complexity, algorithms and approximability. In D. Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization (pp. 1493–1641). Boston: Springer.
5. Conway, R. W., Maxwell, W., & Miller, L. (1967). Theory of Scheduling. Reading. MA: Addison-Wesley.