//-->
Worst-Case Analysis of Heuristic Algorithms for Two-Machine Open Shop Scheduling Problem with Route-Dependent Processing Times.
Strusevich, V.A., (1993)
A New Heuristic for Three-Machine Flow Shop Scheduling.
Chen, B., (1993)
Non-preemptive two-machine open shop scheduling with non-availability constraints
Breit, J., (2003)