On minimizing the weighted number of late jobs in unit execution time open-shops

Abstract We study unit execution time open-shops with integer release dates. This paper shows that, in this environment, the minimum weighted number of late jobs can be computed in polynomial time by dynamic programming. The complexity status of the corresponding problem Om | p ij =1, r i |∑ w i U i was unknown before.

[1]  Philippe Baptiste,et al.  Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times , 1999 .

[2]  Teofilo F. Gonzalez,et al.  Unit Execution Time Shop Problems , 1982, Math. Oper. Res..

[3]  B. J. Lageweg,et al.  Scheduling identical jobs on uniform parallel machines , 1989 .

[4]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[5]  Vadim G. Timkovsky,et al.  Is a Unit-time Job Shop Not Easier Than Identical Parallel Machines? , 1998, Discret. Appl. Math..

[6]  W. Kubiak,et al.  A Note On The Complexity Of Openshop Scheduling Problems , 1991 .

[7]  Peter Brucker,et al.  Scheduling unit time open shops to minimize the weighted number of late jobs , 1993, Oper. Res. Lett..

[8]  Andrei A. Gladky.  On Complexity of Minimizing Weighted Number of Late Jobs in Unit Time Open Shops , 1997, Discret. Appl. Math..

[9]  Peter Brucker,et al.  Open shop problems with unit time operations , 1993, ZOR Methods Model. Oper. Res..

[10]  Svetlana A. Kravchenko.  On the complexity of minimizing the number of late jobs in unit time open shop , 2000, Discret. Appl. Math..

[11]  R. L. Bulfin,et al.  Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates , 1988, Oper. Res..

[12]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

[13]  Philippe Baptiste,et al.  Scheduling equal-length jobs on identical parallel machines , 2000, Discret. Appl. Math..

[14]  Gerhard J. Woeginger,et al.  Minimizing the weighted number of late jobs in UET open shops , 1995, Math. Methods Oper. Res..

[15]  Barbara B. Simons,et al.  Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines , 1983, SIAM J. Comput..