A comparative study of some priority dispatching rules under different shop loads

References

• ANDERSON , E. J. , and NYIRENDA , J. C. , 1990 , Two new rules to minimize tardiness in a job shop. International Journal of Production Research , 28 ( 12 ), 2277 – 2292 .
   Web of Science ®Google Scholar
• BAKER , K. R. , 1974 , Introduction to Sequencing and Scheduling , ( Wiley, New York ).
   Google Scholar
• BERRY , W. L. , 1972 , Priority scheduling and inventory control in job lot manufacturing systems. AIIE Transactions , 4 , 267 – 276 .
   Google Scholar
• BLACKSTONE , J. H. , PHILLIPS , D. T. and Hocc , G. L. , 1982 , A state of-the-art survey of dispatching rules for manufacturing job shop operations. InternationalJournal of Production Research , 20 ( 1 ), 27 – 45 .
   Web of Science ®Google Scholar
• CHRISTY , D. , and KANET , J. , 1990 , Manufacturing systems with forbidden early shipment: implications for choice of scheduling rules. International Journal of Production Research , 28 ( 1 ), 91 – 100 .
   Web of Science ®Google Scholar
• DAR‐EL , E. M. , and WYSK , R. A. , 1982 , Job shop scheduling—a systematic approach. Journal of Manufacturing Systems , 1 ( 1 ), 77 – 88 .
   Google Scholar
• DEANE , R. H. , and MOODIE , C. L. , 1972 , A dispatching methodology for balancing workload assignments in a shop production facility. AIIE Transactions , 4 , 277 – 283 .
   Google Scholar
• DUDEK , R. A. , PANWALKAR , S. S. , and SMITH , M. L. , 1992 , The lessons of flowshop scheduling research. Operations Research , 40 ( 1 ), 1992 .
   Google Scholar
• FRENCH , S. , 1982 , Sequencingand Schiduling: An Introduction to the Mathematics of the Job-Shop , ( Ellis Horwood, Chichester , West Sussex ).
   Google Scholar
• FRY , T. , PHILIPOOM , P. , and BLACKSTONE , J. , 1988 , A simulation study of processing time dispatching rules. Journal of Operations Management , 7 ( 4 ), 77 – 92 .
   Google Scholar
• HOLLOWAY , C. A. , and NELSON , R. T. , 1974, Job shop scheduling with due dates and variable processing times, Management Science , 20 (9), 1264–1275.
   Web of Science ®Google Scholar
• KIM , Y. D. , 1990 , A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings. International Journal of Production Research , 28 ( 5 ), 953 – 962 .
   Web of Science ®Google Scholar
• LAHIRI , S. , RAJENDRAN , C. , and NARENDRAN , T. , 1993 , Evaluation of heuristics for scheduling in a flow shop: a case study. Production Planning and Control , 4 ( 2 ), 153 – 158 .
   Google Scholar
• MAHMOODl , F. , DOOLEY , K. , and STARR , P. , 1990 , An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell. International Journal of Production Research , 28 ( 9 ), 1695 – 1711 .
   Google Scholar
• MUHLEMANN , A. P. , LOCKETT , A. G. , and FARM , C. K. , 1982 , Job shop scheduling heuristics and frequency of scheduling. International Journal of Production Research; , 20 ( 2 ), 227 – 241 .
   Web of Science ®Google Scholar
• PANWALKAR , S. , and ISKANDER , W. , 1977 , A survey ofscheduling rules. Operations Research , 25 ( 1 ), 45 – 61 .
   Web of Science ®Google Scholar
• RUSSELL , R. S. and TAYLOR , B. W., III , 1985 , An evaluation of scheduling policies in a dual resource constrained assembly shop. AIIE Transactions , 17 ( 3 ), 219 – 232 .
   Web of Science ®Google Scholar
• SADOWSKI , R. and JACOBSON , R. , 1978 , Scheduling algorithms for the unbalanced production line: an analysis and comparison. AIIE Transactions. , 10 ( 1 ), 31 – 39 .
   Web of Science ®Google Scholar
• SCHULTZ , C. , 1989 , An expediting heuristic for the shortest processing time dispatching rule. International Journal of Production Research , 27 ( 1 ), 31 – 41 .
   Web of Science ®Google Scholar
• WHITE , C. , 1991 , Scheduling to minimize tardiness. Production Planning and Control , 2 ( 2 ), 102 – 109 .
   Google Scholar
• ZEESTRATEN , M. , 1990 , The look ahead dispatching procedure. Intemationai Journal of Production Research , 28 ( 2 ), 369 – 384 .
   Web of Science ®Google Scholar