Production scheduling dictates highly constrained mathematical models with complex and often contradicting objectives. Evolutionary algorithms can be formulated almost independently of the detailed shaping of the problems under consideration. As one would expect, a weak formulation of the...

The flexible job-shop scheduling problem (FJSP) is a typical mixed-integer linear programming problem, which plays an important role in operation research. A variable neighborhood search (VNS) enhance genetic algorithm (VNSeGA) is presented to minimize makespan of FJSP in this paper. In VNSeGA,...