Heuristic Algorithms to Minimize Total Weighted Tardiness on the Single Machine and Identical Parallel Machines with Sequence Dependent Setup and Future Ready Time
This study generates heuristic algorithms to minimize the total weighted tardiness on the single machine and identical parallel machines with sequence dependent setup and future ready time. Due to the complexity of the considered problem, we propose two new Apparent Tardiness Cost based (ATC-based) rules. The performances of these two rules are evaluated on the single machine and identical parallel machines. Besides of these two rules, we also propose a look-ahead identical parallel machines heuristic (LAIPM). When a machine becomes idle, it selects a job to process from available jobs and near future jobs. The proposed method, LAIPM, is evaluated with other look-ahead methods on the identical parallel machines
