A two-stage tabu search algorithm for large scale multi-constraints scheduling problems

Flexible job shop scheduling problem is a kind of typical production scheduling problems. There are more constraints exists in practical circumstance. This paper has a deep research on flexible job shop scheduling problem with sequence dependent setup time and different type of machines in one workgroup. At first, problem formulation is given; then we construct the mathematic model for the multi-constraints scheduling problems; design the encoding and decoding scheme of problem solution; at last, experiments have done for algorithm validation. Experiments results show that two-stage tabu search algorithm proposed in this paper can get better solution than many classic algorithms and the algorithm is fit for large scale multi-constraints flexible job shop scheduling problems.