Apply MGA to Multi-objective Flexible Job Shop Scheduling Problem

Through describing the characteristic of current genetic scheduling algorithm, a modified genetic scheduling algorithm (MGA) is proposed according to multi-objective Flexible Job Shop Scheduling Problem. This algorithm introduces a specific representation to reduce the solving space. It obtains the reasonable individuals by the selected principle and weakest link effect. Based on analyzing the benchmark of Flexible Job Shop Scheduling Problem, the computation results validate the effectivity of the proposed algorithm.