Zhang, Xiandong; van de Velde, Steef - In: European Journal of Operational Research 204 (2010) 1, pp. 14-19
We analyze the performance of the greedy algorithm for the on-line two-machine open shop scheduling problem of minimizing makespan, in which time lags exist between the completion time of the first and the start time of the second operation of any job. The competitive ratio for the greedy...