Scheduling algorithm and scheduling mathematical model of machining time

This study investigates a time-dependent scheduling method for solving the problem of mass scheduling in single-machine task planning. A number of inverse scheduling problems are examined. First, the inverse scheduling problem with maximum tardiness objective on single machines is investigated. Then, the inverse scheduling problem of the total weighted completion time problem with unit processing time on identical parallel machines is explored. Finally, the inverse scheduling problem of the total completion time objective on identical parallel machines is studied. The necessary and sufficient conditions for optimality of the maximum tardiness problem on single machines are determined, and the mathematical formulations of inverse scheduling problems and methods for solving these problems are established. The formulations for the optimal solutions of inverse scheduling problems under special conditions are also developed. Experimental results show that the proposed method can substantially improve the performance.