A polynomial algorithm for an open shop problem with unit processing times and tree constraints

H. Bräsel, D. Kluge, F. Werner
1995 Discrete Applied Mathematics  
In this paper we consider the open shop problem with unit processing times and tree constraints (outtree) between the jobs. The complexity of this problem was open. We present a polynomial algorithm which decomposes the problem into subproblems by means of the occurrence of unavoidable idle time. Each subproblem can be solved on the base of an algorithm for the corresponding open shop problem without tree constraints. Keywords: Scheduling; Open shop problems; Polynomial algorithm *Corresponding
more » ... author. 0166-218X/95/$09.50 0 1995-Elsevier Science B.V. All rights reserved SSDI 0166-218X(93)E0156-S H. Brtisel et al. / Discrete Applied Mathematics 59 (1995) 11-21 13 J i J 2 J3 Fig. 1. Graph GS = (V, E). M J 2 J J 3 2 i M J J 1 3 2 J* ,
doi:10.1016/0166-218x(93)e0156-s fatcat:34dnlf563nbpxftgcm5al3nqp4