A new dispatching rule for single machine scheduling to minimize the total weighted tardiness

초록

This study considers the problem of determining the sequence of jobs on a single machine for the objective of minimizing the total weighted tardiness. As one of practical solution approaches to the complicated optimization problem, we suggest a new dispatching rule that combines the concepts of weighted shortest processing time and weighted minimum slack time. To show the performance of the new dispatching rule, a computational test was done on a number of randomly generated instances, and the result shows that the new dispatching rule outperforms the existing rules significantly.