Hybrid evolutionary algorithm with multi-operation precise joint movement neighborhood structure for job shop scheduling problem
Aiming at the Job Shop Scheduling problem(JSP),a Hybrid Evolutionary Algorithm with multi-operation precise joint Movement Neighborhood Structure(HEA-MNS)was proposed to optimize the maximum completion time.The judgment condition of invalid movement operation in the critical block was given theoretically,and the neighborhood structure of precise joint movement of three pairs of operations was designed accordingly.To avoid premature convergence,a cross-parent selection operator based on neighborhood penalty and a population updating strategy based on dynamic penalty threshold were introduced.By comparing HEA-MNS with other state-of-the-art algorithms on the JSP benchmark,its effectiveness and stability were proved.
NETL
NSTL
万方数据
