\input zb-basic
\input zb-ioport
\iteman{io-port 06091671}
\itemau{Wen, Zhenwei}
\itemti{Two-machine open shop scheduling with machine-dependent processing times.}
\itemso{Oper. Res. Trans. 15, No. 4, 65-74 (2011).}
\itemab
Summary: A two-machine open shop scheduling problem with machine-dependent processing times $O_2|p_{ij}=p_i, p_2<p_1<2p_2,\ {\text{Non-Idle}}|\Sigma C_j$ is examined. {\it S. M. Xiang} and {\it G. C. Tang} [OR Trans. 2, No. 1, 71--78 (1998)] proved that this problem can be transformed to an assignment problem which is polynomially solvable. {\it W. Yu} and {\it G. Ying} [OR Trans. 2, No. 2, 84--94 (1998)] gave an explicit solution of this problem, and proved its optimality. In addition they presented that the explicit solution is not exclusive and other optimal solutions are possible existence. We give a simple proof of the optimality of the explicit solution and discuss the uniqueness of the optimal solution.
\itemrv{~}
\itemcc{}
\itemut{scheduling; open shop; transportation problem; assignment problem; optimal solution}
\itemli{}
\end