为求解含不一致任务重量的同型熔炼炉批调度问题,建立了最小化最大任务完工时间优化模型,设计了一种混合粒子群算法(HPSO)。算法使用随机生成的任务序列作为粒子,采用批首次匹配(BFF)规则对任务序列分批,最长加工时间( LPT)规则将批分配到批处理机,并提出了一种最小完工时间差( MCD)规则对LPT调度结果进行优化;为避免早熟,算法引入交叉和变异操作搜索最优解。通过仿真实验与SA、GA算法对比,实验结果表明算法具有良好的性能。%To solve the batch scheduling problem of identical parallel melting furnaces with non-identical job weights, an optimization model is established to minimize the makespan on scheduling melting fur-naces, and the hybrid particle swarm optimization based jobs sequence (HPSO) designed.In the HPSO, particles are represented by job sequences , the batch first fit ( BFF) heuristic used to group jobs to bat-ches, the longest processing time(LPT) heuristic adopted to assign batches to batch processing machines , and the minimum completion time difference ( MCD ) heuristic proposed to optimize scheduling results by LPT heuristic .In order to avoid the premature convergence problem , the HPSO introduces the crossover and mutation operator to search for the optimal solution .Compared with SA and GA algorithm , simulation experimental results demonstrated that HPSO has a good performance .
展开▼