Heuristics for minimizing mean tardiness form parallel machines

The concept of parallel operations has been widely used in manufacturing and data processing. However, not many efficient methods have been proposed to reduce job tardiness. This article proposes an efficient heuristic to minimize the mean tardiness of a set of tasks with known processing times and due dates for single and m parallel machines. For the single-machine case, the proposed heuristic is compared with the well-known Wilkerson and Irwin algorithm; for the m parallel machine case, it is compared with an extension of the Wilkerson-Irwin algorithm. We also introduce a simple dispatching rule, and it is compared with some existing dispatching rules. The comprehensive simulation results show that the proposed heuristic performs better than the Wilkerson-Irwin algorithm at a significantly reduced computational time.

[1]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[2]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[3]  Eugene L. Lawler.  On Scheduling Problems with Deferral Costs , 1964 .

[4]  James G. Root.  Scheduling with Deadlines and Loss Functions on k Parallel Machines , 1965 .

[5]  Michael H. Rothkopf,et al.  Scheduling Independent Tasks on Parallel Processors , 1966 .

[6]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[7]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[8]  V. Srinivasan.  A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[9]  J. D. Irwin,et al.  An Improved Method for Scheduling Independent Tasks , 1971 .

[10]  Salah E. Elmaghraby,et al.  On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .

[11]  Kenneth R. Baker,et al.  Scheduling with parallel processors and linear delay costs , 1973 .

[12]  K. R. Baker.  Procedures for sequencing tasks with one resource type , 1973 .

[13]  W. A. Horn.  Some simple scheduling algorithms , 1974 .

[14]  Kenneth R. Baker,et al.  An experimental comparison of solution algorithms for the single‐machine tardiness problem , 1974 .

[15]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[16]  J. J. Brennan,et al.  An Improved Algorithm for Scheduling Jobs on Identical Machines , 1977 .

[17]  H. Emmons,et al.  Scheduling on Parallel Machines to Minimize Two Criteria Related to Job Tardiness , 1977 .