Optimal Algorithm of the M₃ Scheduling Problem

M₃ scheduling problem is one of the most difficult problems in the world in the field of operational research. Analysis of the problem suggests that all the processing time is equal to both the processing time of all parts and floor time on the third sets of machine tools. Correspondingly the minor floor time on the third machine tools matches the fewest total time. According to such thoughts to reduce the floor time of the third machine as much as possible, the authors design a general algorithm for M₃ scheduling problem, and give the algorithm steps. Finally, through examples the authors tested and verified the feasibility of the algorithm.