An efficient algorithm for the single machine total tardiness problem

References

• Baker . K.R. and Bertrand . J.W.M. ( 1982 ) A dynamic priority rule for scheduling against due-dates. Journal oj Operations Management , 3 , 37 – 42 .
   Google Scholar
• Chang , S. , Lu , Q. , Tang , G. and Yu , W. ( 1995 ) On decomposition of the total tardiness problem. Operutions Research Letters , 17 ,221229.
   Web of Science ®Google Scholar
• Du , J. and Leung , T. ( 1990 ) Minimizing total tardiness on one machine is NP-hard. Operations Research , 15 , 483 – 495 .
   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
• Fisher , M.L. ( 1976 ) A dual algorithm for the one machine scheduling problem. Mathematical Programming , 11 , 229 – 251 .
   Web of Science ®Google Scholar
• Fry , T.D. , Vicens . L. Macleod . K. and Fernandez , S. ( 1989 ) A heuristic solution procedure to minimize T-bar on a single machine. Journal oj the Operational Research Society , 40 , 293 – 297 .
   Web of Science ®Google Scholar
• Holsenback , J.E. and Russell , R.M. ( 1992 ) A heuristic algorithm for sequencing on one machine to minimize total tardiness. Journal of the Operational Research Society , 43 , 53 – 62 .
   Web of Science ®Google Scholar
• Lawler , E.L. ( 1977 ) A 'pseudo polynomial' algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics , 1 , 331 – 342 .
   Google Scholar
• Lenstra , J.K. , Rinnooy, Kan , A.H.G. and Brucker . P. ( 1977 ) Complexity of machine scheduling problems. Annals of Discrete Mathematics , 1 , 343 – 362 .
   Google Scholar
• McNaughton , R. ( 1959 ) Scheduling with deadlines and loss functions. Management Science , 6 , 1 – 12 .
   Web of Science ®Google Scholar
• Panwalkar , S.S. , Smith , M.L. and Koulamas , CP , ( 1993 ) A heuristic for the single machine tardiness problem. European Journal of Operations Research , 70 , 304 --310.
   Web of Science ®Google Scholar
• Picard , J.c. and Queyranne , M. ( 1978 ) The time dependent traveling salesman problem and its application to the tardiness problem in one machine scheduling. Operations Research , 26 , 86 – 110 .
   Web of Science ®Google Scholar
• Polls , C.N. and van Wassenhove , L.N. ( 1982 ) A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters , 11 , 177 – 181 .
   Google Scholar
• Polls , C.N. and van Wassenhove , L.N. ( 1985 ) A branch and bound algorithm for the total weighted tardiness problem. Operations Research , 33 , 363 – 377 .
   Web of Science ®Google Scholar
• Potts , CN. and van Wassenhove , L.N. ( 1987 ) Dynamic programming and decomposition approaches for the single machine total tardiness problem. European Journal on Operational Research , 32 , 405 – 414 .
   Web of Science ®Google Scholar
• Rachamadugu , R.V. and Morton , T.E , ( 1981) Myopic heuristics for the single machine weighted tardiness problem. Working Paper 28–81-82, Graduate School of Industrial Administration , Carnegie Mellon University, Pittsburgh.PA.
   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
• Schrage , L. and Baker , K.R. ( 1978 ) Dynamic programming solution of sequencing problems with precedence constraints. Operations Research , 26 , 444 – 449 .
   Web of Science ®Google Scholar
• Schwimer , J. ( 1972 ) On the 11job one machine sequence independent scheduling with tardiness penalties: a branch and bound solution. Management Science , 18 , 301 – 313 .
   Web of Science ®Google Scholar
• Sen , T.T. , Austin , L.M. and Ghandforoush , P. ( 1983 ) An algorithm for the single machine sequencing problem to minimize total tardiness. IfE Transactions , 15 , 363 – 366 .
   Web of Science ®Google Scholar
• Sen , T,T. and Borah , B.N. ( 1991 ) On the single machine scheduling problem with tardiness penalties. Journal of the Operational Research Society , 42 , 695 – 702 .
   Web of Science ®Google Scholar
• Srinivasan . V. ( 1971 ) A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. Naval Research Logistics Quarter , 18 , 317 – 327 .
   Google Scholar
• Szwarc , W. and Mukhopadhyay , S.K. ( 1996 ) Decomposition of the single machine total tardiness problem. Operations Research Letters , 19 , 243 – 250 .
   Web of Science ®Google Scholar
• Tansel , B.C. and Sabuncuoglu , I. ( 1997 ) New insights on the single machine total tardiness problem. Journal of the Operational Research Society , 48 , 82 – 89 .
   Web of Science ®Google Scholar
• Wilkerson , J.L. and Irwin , J.D. ( 1971 ) An improved method for scheduling independent tasks. AIIE Transactions , 3 , 239 – 245 .
   Google Scholar