An efficient priority rule for scheduling job shops to minimize mean tardiness

References

• Baker , K. R. 1974 . Introduction to Sequencing and Scheduling , New York , NY : Wiley .
   Google Scholar
• Baker , K. R. 1984 . Sequencing rules and due date assignments in a job shop . Management Science , 9 : 1093 – 1104 . [CSA]
   Web of Science ®Google Scholar
• Baker , K. R. and Bertrand , J. W.M. 1982 . A dynamic priority rule for sequencing against due-dates . Journal of Operations Management , 3 : 37 – 42 . [CSA] [CROSSREF]
   Google Scholar
• Baker , K. R. and Dzielinski , B. P. 1960 . Simulation of a simplified job shop . Management Science , 6 : 311 – 323 . [CSA]
   Web of Science ®Google Scholar
• Bhaskaran , K. and Pinedo , M. 1992 . “ Dispatching ” . In Handbook of Industrial Engineering, , 2nd edn. , Edited by: Salvendy , G. New York , NY : Wiley .
   Google Scholar
• Carroll , D. C. 1965 . Heuristic sequencing of jobs with single and multiple components , Ph.D. Dissertation Cambridge , MA : Sloan School of Management, MIT .
   Google Scholar
• Cheng , T. C. and Gupta , M. C. 1989 . Survey of scheduling research involving due date determination decisions . European Journal of Operational Research , 38 : 156 – 166 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Conway , R. W. , Maxwell , W. L. and Miller , L. W. 1967 . Theory of Scheduling , Reading , MA : Addison-Wesley .
   Google Scholar
• Du , J. and Leung , J. Y.-T. 1990 . Minimizing total tardiness on one machine is NP-hard . Mathematica of Operations Research , 15 : 483 – 495 . [CSA]
   Web of Science ®Google Scholar
• Elvers , D. A. and Taube , L. R. 1983 . Time completion for various dispatching rules in job shops . OMEGA , 11 : 81 – 89 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Kutanoglu , E. and Sabuncuoğlu , I. 1999 . An analysis of heuristics in a dynamic job shop with weighted tardiness objective . International Journal of Production Research , 37 : 165 – 187 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Nanot , Y. R. 1963 . An experimental investigation and comparative evaluation of priority disciplines in job-shop-like queueing networks , Management Science Research Report, No. 87 Los Angeles , CA : UCLA .
   Google Scholar
• Panwalker , S. S. and Iskander , W. 1977 . A survey of scheduling rules . Operations Research , 25 : 45 – 61 . [CSA]
   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 : 1035 – 1047 . [CSA]
   Web of Science ®Google Scholar
• Weng , M. X. , Lu , J. and Ren , H. 2001 . Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective . International Journal of Production Economics , 70 : 215 – 226 . [CSA] [CROSSREF]
   Web of Science ®Google Scholar
• Wilbrecht , J. K. and Prescott , W. R. 1969 . The influence of setup time on job shop performance . Management Science , 16 : 274 – 280 . [CSA]
   Web of Science ®Google Scholar