Research on scheduling method for urgent orders based on genetic algorithm

A scheduling model proposed is based on earliness/tardiness penalty and the stability of the original production plan is taken into more consideration, which aims at the flexible job shop scheduling problem with urgent order insertion. Moreover, a genetic algorithm with multilevel coding is designed to settle the above problem, and in the solving process, try to make the processing procedure arrangement priority in the new production plan after the urgent order is added as small as possible compared with the original plan. In contrast to the approach to abandoning the original production plan and directly generating a new production plan with the minimum goal of earliness/tardiness penalty, the results suggest that this method may not only achieve good effects on the optimization of advanced or delay penalties, but also take the original the stability of the production plan into consideration.