Abstract

This paper proposed discrete particle swarm optimization(DPSO) algorithm to solve lot-streaming no-wait flow shop scheduling problem(LNFSP) with the objective of the maximum completion time. The natural encoding scheme based on job permutation and newly-designed methods were adopted to produce new individuals . After the DPSO-based exploration, a efficient fast local search based on swap neighborhood structure is used to enhance the exploitation capability. Simulation results show the effectiveness of the proposed algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call