A note on the two machine job shop with the weighted late work criterion

The paper presents a dynamic programming approach for the two-machine nonpreemptive job-shop scheduling problem with the total weighted late work criterion and a common due date $$(J2\,|\,n_i \le 2,d_i = d\,|\,Y_w )$$, which is known to be NP-hard. The late work performance measure estimates the quality of an obtained solution with regard to the duration of late parts of tasks not taking into account the quantity of this delay. Providing a pseudopolynomial time method for the problem mentioned we can classify it as binary NP-hard.

[1]  Wieslaw Kubiak,et al.  Scheduling shops to minimize the weighted number of late jobs , 1994, Oper. Res. Lett..

[2]  Gerd Finke,et al.  Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors , 1987, Inf. Process. Lett..

[3]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[4]  Malgorzata Sterna.  Late work scheduling in shop systems , 2006 .

[5]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[6]  Jacek Blazewicz,et al.  Scheduling preemptible tasks on parallel processors with information loss , 1984 .

[7]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

[8]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[9]  X. Chao,et al.  Operations scheduling with applications in manufacturing and services , 1999 .

[10]  Zhihui Xue,et al.  Review of Scheduling computer and manufacturing processes by Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Guenter Schmidt, Jan Weglarz Springer-Verlag 2001 , 2003 .

[11]  Malgorzata Sterna,et al.  Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..

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

[13]  Malgorzata Sterna,et al.  The two-machine flow-shop problem with weighted late work criterion and common due date , 2005, Eur. J. Oper. Res..

[14]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[15]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .