An exact approach to minimizing total weighted tardiness with release dates

References

• Abdul-Razaq , T.S. , Potts , C.N. , van Wassenhove , L.N. ( 1990 ) A survey of algorithms for the single-machine total weighted tardiness scheduling problem. Discrete Applied Mathematics , 26 , 235 – 253 .
   Web of Science ®Google Scholar
• Akturk , M.S. and Ozdemir , D. ( 1998 ) New dominance properties for 1|rj|ΣwjTjproblem. Technical Report No. 98–30 , Department of Industrial Engineering, Bilkent University , Turkey .
   Google Scholar
• Akturk , M.S. and Yildirim , M.B. ( 1998 ) A new lower bounding scheme for the total weighted tardiness problem. Computers and Operations Research , 25 , 265 – 278 .
   Web of Science ®Google Scholar
• Beloudah , H. , Posner , M.E. and Potts , C.N. ( 1992 ) Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics , 36 , 213 – 231 .
   Web of Science ®Google Scholar
• Chand , S. , Traub , R. and Uzsoy , R. ( 1996 ) Single machine scheduling with dynamic arrivals decomposition results and an improved algorithm. Naval Research Logistics , 43 , 709 – 719 .
   Web of Science ®Google Scholar
• Chu , C. ( 1992a ) A branch-and-bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics , 39 , 859 – 875 .
   Web of Science ®Google Scholar
• Chu , C. ( 1992b ) A branch-and-bound algorithm to minimize total tardiness with unequal release dates. Naval Research Logistics , 39 , 265 – 283 .
   Web of Science ®Google Scholar
• Chu , C. and Portmann , M.C. ( 1992 ) Some new efficient methods to solve the n|1|riΣTischeduling problem. European Journal of Operational Research , 58 , 404 – 413 .
   Web of Science ®Google Scholar
• Emmons , H. ( 1969 ) One machine sequencing to minimize certain functions of job tardiness. Operations Research , 17 , 701 – 715 .
   Web of Science ®Google Scholar
• Hariri , A.M.A. and Potts , C.N. ( 1983 ) An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics , 5 , 99 – 109 .
   Web of Science ®Google Scholar
• Lawler , E.L. ( 1977 ) A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics , 1 , 331 – 342 .
   Google Scholar
• Potts , C.N. , van Wassenhove , L.N. ( 1985 ) A branch and bound algorithm for total weighted tardiness problem. Operations Research , 33 , 363 – 377 .
   Web of Science ®Google Scholar
• Potts , C.N. , van Wassenhove , L.N. ( 1988 ) Algorithms for scheduling a single machine to minimize the weighted number of late jobs. Management Science , 34 , 843 – 858 .
   Web of Science ®Google Scholar
• Rachamadugu , R.M.V. ( 1987 ) A note on weighted tardiness problem. Operations Research , 35 , 450 – 452 .
   Web of Science ®Google Scholar
• Rinnooy Kan , A.H.G. ( 1976 ) Machine Scheduling Problems Classification, Complexity and Computations , NijhofT , The Hague .
   Google Scholar
• Rinnooy Kan , A.H.G. , Lageweg , B.J. and Lenstra , J.K. ( 1975 ) Minimizing total costs in one-machine scheduling. Operations Research , 23 , 908 – 927 .
   Web of Science ®Google Scholar
• Smith , W.E. ( 1956 ) Various optimizers for single-stage production. Naval Research Logistics Quarterly , 3 , 59 – 66 .
   Google Scholar
• Szwarc , W. ( 1993 ) Adjacent orderings in single machine scheduling with earliness and tardiness penalties. Naval Research Logistics , 40 , 229 – 243 .
   Web of Science ®Google Scholar
• Vairaktarakis , G.L. and Lee , C.Y. ( 1995 ) The single-machine scheduling problem to minimize total tardiness subject to minimum number of tardy jobs. HE Transactions , 27 , 250 – 256 .
   Google Scholar