Minimizing Maximum Tardiness in Single Computer Numerical Control Machine Scheduling with Tool Changes

摘要

This study considers the problem of scheduling a set of jobs on a single Computer Numerical Control (CNC) machine where the cutting tool is subject to wear, aiming to minimize the maximum tardiness. Four mixed binary integer programming models were developed to solve this problem optimally. To solve large-sized problems, two heuristics were also developed. This study presents the computational results to demonstrate the efficiency of the models and the effectiveness of the heuristics.