Open Shop Dense Scheduling Algorithm Based on Semi-Matching Theory

Open shop scheduling problem was studied, and a dense scheduling algorithm based on semi-matching theory was proposed. Using decomposition strategy, the scheduling problem was converted into iterations of resource assignment. Based on this, dense scheduling was constructed by the construction and optimization of primal solution. To improve computational efficiency, the semi-matching model of the resource assignment problem with the optimal function of load balancing was developed. The optimal semi-matching searching algorithm based on augmenting path was proposed. And a dense scheduling construction method with two steps was proposed, as well as initial solution optimization methods and mechanisms to eliminate interference among machines. At last, the validity of the developed scheduling algorithm was illustrated by benchmarks of Taillard.