Correlation among tardiness-based measures for scheduling using priority dispatching rules

References

• Baker , K. R. 1974 . Introduction to Sequencing and Scheduling , New York : Wiley .
   Google Scholar
• Baker , K. 1984 . Sequencing Rules and Due-date Assignments in a Job Shop . Management Science , 30 ( 9 ) : 1093 – 1104 .
   Web of Science ®Google Scholar
• Baker , K. R. and Bertrand , J. W. M. 1982 . A Dynamic Priority Rule for Scheduling against Due-dates . Journal of Operations Management , 3 ( 1 ) : 37 – 42 .
   Google Scholar
• 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
• Carroll, D. C. 1965. “Heuristic Sequencing of Jobs with Single and Multiple Components.” Thesis (Doctoral). Sloan School of Management, MIT.
   Google Scholar
• Chang , P. C. and Su , L. H. 2001 . Scheduling Jobs on One Machine to Minimize the Maximum Lateness with a Minimum Number of Tardy Jobs . Computers & Industrial Engineering , 40 ( 4 ) : 349 – 360 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. and Gupta , M. C. 1989 . Survey of Scheduling Research Involving Due Date Determination Decisions . European Journal of Operational Research , 38 ( 2 ) : 156 – 166 .
   Web of Science ®Google Scholar
• Dominic , P. D. D. , Kaliyamoorthy , S. and Kumar , M. S. 2004 . Efficient Dispatching Rules for Dynamic Job Shop Scheduling . The International Journal of Advanced Manufacturing Technology , 24 ( 1 ) : 70 – 75 .
   Web of Science ®Google Scholar
• Eilon , S. and Cotterill , D. J. 1968 . A Modified SI Rule in Job Shop Scheduling . International Journal of Production Research , 7 ( 2 ) : 135 – 145 .
   Google Scholar
• French , S. 1982 . Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop , Chichester : Ellis Horwood .
   Google Scholar
• Kemppainen, K. 2005. “Priority Scheduling Revisited – Dominant Rules, Protocols and Integerated Order Management.” Thesis (Doctoral). Helsinki School of Economics.
   Google Scholar
• Laslo , Z. 2010 . Project Portfolio Management: An Integrated Method for Resource Planning and Scheduling to Minimize Planning/Scheduling-dependent Expenses . International Journal of Project Management , 28 : 609 – 618 .
   Web of Science ®Google Scholar
• Laslo , Z. , Golenko-Ginzburg , D. and Keren , B. 2008 . Optimal Booking of Machines in a Virtual Job-shop with Stochastic Processing times to Minimize Total Machine Rental and Job Tardiness Costs . International Journal of Production Economics , 111 : 812 – 821 .
   Web of Science ®Google Scholar
• Lejmi , T. and Sabuncuoglu , I. 2002 . Effect of Load, Processing Time and Due Date Variation on the Effectiveness of Scheduling Rules . International Journal of Production Research , 40 ( 4 ) : 945 – 974 .
   Web of Science ®Google Scholar
• Mainieri, G. and D. Ronconi. 2010. “New Heuristics for Total Tardiness Minimization in a Flexible Flowshop.” Optimization Letters 1–20.
   Google Scholar
• Malve , S. and Uzsoy , R. 2007 . A Genetic Algorithm for Minimizing Maximum Lateness on Parallel Identical Batch Processing Machines with Dynamic Job Arrivals and Incompatible Job Families . Computers & Operations Research , 34 ( 10 ) : 3016 – 3028 .
   Web of Science ®Google Scholar
• Mattfeld , D. C. and Bierwirth , C. 2004 . An Efficient Genetic Algorithm for Job Shop Scheduling with Tardiness Objectives . European Journal of Operational Research , 155 ( 3 ) : 616 – 630 .
   Web of Science ®Google Scholar
• Moser, M. and S. Engell. 1992. “A Survey of Priority Rules for FMS Scheduling and their Performance for the Benchmark Problem”. In: Proceeding of the 31st Conference on Decision and Control, Arizona. IEEE, 392–397.
   Google Scholar
• Panwalker , S. S. and Iskander , W. 1977 . A Survey of Dispatching Rules . Operations Research , 25 : 45 – 61 .
   Web of Science ®Google Scholar
• Pierreval , H. and Mebarki , N. 1997 . Dynamic Selection of Dispatching Rules for Manufacturing System Scheduling . International Journal of Production Research , 35 ( 6 ) : 1575 – 1591 .
   Web of Science ®Google Scholar
• Pinedo , M. L. 2008 . Scheduling: Theory, Algorithms, and Systems , Berlin : Springer .
   Google Scholar
• Raman , N. , Talbot , F. B. and Rachamadugu , R. V. 1989 . Due Date Based Scheduling in a General Flexible Manufacturing System . Journal of Operations Management , 8 ( 2 ) : 115 – 132 .
   Google Scholar
• Russell , R. S. , Dar-El , E. M. and Taylor , B. W. 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
• Schultz , C. R. 1989 . An Expediting Heuristic for the Shortest Processing Time Dispatching Rule . International Journal of Production Research , 27 : 31 – 41 .
   Web of Science ®Google Scholar