No abstract

Traditional job shop scheduling running time length and complexity of large defects, the paper proposes a rule-based optimization algorithm, with the longest duration as a condition of relative rest or scheduling rules to optimize the scheduling operations. The scheduling rules to ensure that the process of the longest remaining duration is scheduled and Priority scheduling the process that has the shortest working hours while. By comparing the relative remaining duration, to solve the optimal solution for each part of the scheduling, So that the entire operation to the global optimal solution or near optimal solutions. And provide algorithms of the mathematical model, the model of algorithm, the flow chart of algorithm and the specific code of it. Practice shows that in the face of complex scheduling, this scheduling algorithm that can guarantee the computing speed, but also shorten the construction period and close to the optimal solution; in the actual project has a strong practical value.