1. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in Handbooks in Operations Research and Management Science, vol. 4, North Holland, Amsterdam, 1993, pp. 445–522.
2. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time, Journal of the Association of Computing Machinery 23 (1976) 665–679.
3. I. Bárány, T. Fiala, Nearly optimum solution of multimachine scheduling problems, Szigma Mathematika Közgazdasági Folyóirat 15 (1982) 177–191 (in Hungarian).
4. V.A. Aksjonov, A polynomial-time algorithm for an approximate solution of a scheduling problem, Upravlyaemye Sistemy 28 (1988) 8–11 (in Russian).
5. B. Chen, V.A. Strusevich, Approximation algorithms for three-machine open shop scheduling, ORSA Journal on Computing 5 (1993) 321–326.