Minimizing total weighted tardiness on a single machine with sequence-dependent setup and future ready time

This paper minimizes total weighted tardiness on a single machine with sequence-dependent setup time and future ready time. The sequence-dependent setup is classified into two categories: continuous sequence-dependent setup and separable sequence-dependent setup. The former is the conventional type, which needs a part on a machine to setup, while the latter does not. The weighted shortest processing time (WSPT) term, the slack term, and the ready time term of the apparent tardiness cost (ATC)-based rules are analyzed. Two dispatching rules, ATC with ready time and continuous setup (ATCRCS) and ATC with ready time and separable setup (ATCRSS), are proposed for the problems which setup are the continuous type and the separable type, respectively. These new rules are evaluated by the best-of-the-best measure and the territory measure of the performance.