Abstract:
Aiming at the scheduling problem of lot streaming flow shop, an improved artificial bee colony algorithm is proposed to attain the objective of minimizing the maximum completion time. In the proposed algorithm, the NEH heuristic is used to produce an initial solution, and the chaos is employed to generate a new candidate. In order to avoid trapping into local optima, the solution not improved in successively generations will be replaced by the perturbation of the found best solution so far. The simulation results verify the effectiveness of the algorithm.