1. V.A. Aksjonov, A polynomial-time algorithm of approximate solution of a scheduling problem. Upravlyaemye Sistemy 28 (1988) 8–11 (in Russian)
2. I. Bárány, T. Fiala, Nearly optimum solution of multimachine scheduling problems. Szigma 15 (1982) 177–191 (in Hungarian)
3. Approximation algorithms for three machine open shop scheduling;Chen;ORSA Journal on Computing,1993
4. Worst-case analysis of heuristics for open shops with parallel machines;Chen;European Journal of Operational Research,1993
5. I.G. Drobouchevitch, V.A. Strusevich, A polynomial algorithm for the three-machine open shop with a bottleneck machine, Annals of Operations Research, to appear