共 54 条
[1]
Cao ZG(2006)On several scheduling problems with rejection or discretely compressible processing times Lect. Notes Comput. Sci. 3959 90-98
[2]
Wang Z(1990)Minimizing total tardiness on one machine is NP-hard Math. Oper. Res. 15 483-495
[3]
Zhang YZ(2017)Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection Comput. Oper. Res. 83 150-156
[4]
Liu SP(2017)Single machine scheduling problems with generalised due-dates and job-rejection Int. J. Prod. Res. 55 3164-3172
[5]
Du J(2013)Minmax due-date assignment with a time window for acceptable lead-times Ann. Oper. Res. 211 167-177
[6]
Leung JYT(2015)Scheduling with a due-window for acceptable lead-times J. Oper. Res. Soc. 66 1578-1588
[7]
Gerstl E(2010)Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date Discret. Appl. Math. 158 1035-1040
[8]
Mor B(2006)A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date Theoret. Comput. Sci. 369 230-238
[9]
Mosheiov G(2013)A note on “Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date” Discrete Appl. Math. 161 2205-2206
[10]
Gerstl E(1977)A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness Ann. Discrete Math. 1 331-342