A HEURISTIC ALGORITHM TO MINIMIZE TOTAL WEIGHTED TARDINESS ON A SINGLE MACHINE WITH RELEASE DATES AND SEQUENCE-DEPENDENT SETUP TIMES

REFERENCES

• Akturk , M. S. and Ozdemir , D. 2000 . An exact approach to minimizing total weighted tardiness with release dates . IIE Transactions , 32 : 1091 – 1101 .
   Google Scholar
• Akturk , M. S. and Ozdemir , D. 2001 . A new dominance rule to minimize total weighted tardiness with unequal release dates . European Journal of Operational Research , 135 : 394 – 412 .
   Web of Science ®Google Scholar
• Chu , C. 1992 . A branch-and-bound algorithm to minimize total tardiness with different release dates . Naval Research Logistics , 39 : 265 – 283 .
   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
• Lawler , E. L. 1977 . A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness . Annals of Discrete Mathematics , 1 : 331 – 342 .
   Google Scholar
• Lee , Y. H. , Bhaskaran , K. and Pinedo , M. 1997 . A heuristic to minimize the total weighted tardiness with sequence-dependent setups . IIE Transactions , 29 : 45 – 52 .
   Web of Science ®Google Scholar
• Lockett , A. G. and Muhlemann , A. P. 1972 . Technical notes: A scheduling problem involving sequence dependent changeover times . Operations Research , 20 ( 4 ) : 895 – 902 .
   Web of Science ®Google Scholar
• Morton , T. E. and Pentico , D. W. 1993 . Heuristic Scheduling Systems New York : Wiley .
   Google Scholar
• Nagar , A. , Haddock , J. and Heragu , S. 1995 . Multiple and bicriteria scheduling: A literature survey . European Journal of Operational Research , 81 : 88 – 104 .
   Web of Science ®Google Scholar
• Gary Parker , R. 1995 . Deterministic Scheduling Ttheory London, , UK : Chapman & Hall .
   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 ( 1 ) : 86 – 110 .
   Web of Science ®Google Scholar
• Raman , N. , Rachamadugu , R. V. and Talbot , F. B. 1989 . Real-time scheduling of an automated manufacturing center . European Journal of Operational Research , 40 : 222 – 242 .
   Web of Science ®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 ( 5 ) : 908 – 927 .
   Web of Science ®Google Scholar
• Rubin , Paul A. and Ragatz , G. L. 1995 . Scheduling in a sequence dependent setup environment with genetic search . Computers and Operations Research , 22 ( 1 ) : 85 – 99 .
   Web of Science ®Google Scholar
• Tan , K. C. , Narasimhan , Ram , Rubin , Paul A. and Ragatz , G. L. 2000 . A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times . Omega , 28 : 313 – 326 .
   Web of Science ®Google Scholar
• Vepsalainen , A. P. J. and Morton , T. E. 1987 . Priority rules for job shops with weighted tardiness costs . Management Science , 33 ( 8 ) : 1035 – 1047 .
   Web of Science ®Google Scholar