Koulamas, Christos; Kyparisis, George J. - In: European Journal of Operational Research 243 (2015) 1, pp. 70-74
We first consider the ordinary NP-hard three-machine proportionate open shop minimum makespan O3|prpt|Cmax problem and show that it is solvable in O(nlog n) time when certain conditions on the total machine load are met. When these conditions are not met, we derive an approximate solution...