A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings

REFERENCES

• BAKER , K. R. , and KANET , J. J. , 1983 , Job shop scheduling with modified due dates . Journal of Operations Management , 4 ( 1 ), 11 – 22 .
   Google Scholar
• BARKER , J. B. , and MCMAHON , G. B. , 1985 , Scheduling the general job–shop . Management Science , 31 ( 5 ), 594 – 598 .
   Web of Science ®Google Scholar
• BERRY , W. L. , and RAO , V. , 1975 , Critical ratio scheduling an experimental analysis . Management Science , 22 ( 2 ), p 192–201 p.
   Google Scholar
• BLACKSTONE, JR , J. H. , PHILLIPS , D. T. , and HOGG , G. L. , 1982 , A state–of–the–art survey of dispatching rules for manufacturing job shop operations . International Journal of Production Research , 20 ( 1 ), 27 – 45 .
   Web of Science ®Google Scholar
• DAR–EL, E. M,WYSK, R, A., 1982 , Job shop scheduling a systematic approach . Journal of Manufacturing Systems , 1 ( 1 ), 77 – 88 .
   Google Scholar
• ELVERS , D. A. , and TAUBE , L. R. , 1983 , Time completion for various dispatching rules in job shops . OMEGA , 11 ( 1 ), 81 – 89 .
   Web of Science ®Google Scholar
• FISHER , M. L. , 1973 , Optimal solution of scheduling problems using Lagrange multipliers . Operations Research , 21 , 1114 – 1127 .
   Web of Science ®Google Scholar
• FISHER , M. L. , LAGEWEG , B. J. , LENSTRA , J. K. ,RINNOOY KAN , A. H. G. , 1983 , Surrogate duality relaxation for job shop scheduling . Discrete Applied Mathematics , 5 , 65 – 75 .
   Web of Science ®Google Scholar
• KIM, Y–D., 1987 , On the superiority of a backward approach in list scheduling algorithms for multi–machine makespan problems . International Journal of Production Research , 25 ( 12 ), 1751 – 1759 .
   Web of Science ®Google Scholar
• LAGEWEG , B. J. , LENSTRA , J. K. ,RINNOOY KAN , A. H. G. , 1977 , Job–shop scheduling by implicit enumeration . Management Science , 24 ( 4 ), 441 – 450 .
   Web of Science ®Google Scholar
• O'GRADY , P. J. ,HARRISON, C, 1985 , A general search sequencing rule for job shop sequencing . I nternational Journal of Production Research , 23 ( 5 ), 961 – 973 .
   Web of Science ®Google Scholar
• PANWALKER , S. S. , and ISKANDER , W. , 1977 , A survey of scheduling rules . Operations Research , 25 ( 1 ), 45 – 61 .
   Web of Science ®Google Scholar
• POTTS , C. N. ,VAN WASSENHOVE , L. N. , 1982 , A decomposition algorithm for the single machine total tardiness problem . Operations Research Letters , 1 ( 5 ), 177 – 181 .
   Google Scholar
• RUSSELL , R. S. , DAR–EL , E. M. ,TAYLOR, III , B. S. , 1987 , A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research , 25 ( 10 ), 1523 – 1540 .
   Web of Science ®Google Scholar
• SCUDDER , G. D. , and HOFFMANN , T. R. , 1985 , Composite cost–based rules for priority scheduling in a randomly routed job shop . International Journal of Production Research , 23 ( 6 ), 1185 – 1195 .
   Web of Science ®Google Scholar
• STECKE , K. E. , and SOLBERG , J. J. , 1985 , The optimality of unbalancing both workloads and machine group sizes in closed queueing networks of multi–server queues . Operations Research , 33 ( 4 ), 882 – 910 .
   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