含忽略工序和不相关机的混合流水车间调度  

Hybrid flowshop scheduling with missing operations and unrelated machines

作　　者：轩华[1] 樊银格 李冰[1] XUAN Hua;FAN Yinge;LI Bing(School of Management Engineering,Zhengzhou University,Zhengzhou 450001,China)

机构地区：[1]郑州大学管理工程学院,河南郑州450001

出　　处：《智能系统学报》2022年第3期459-470,共12页CAAI Transactions on Intelligent Systems

基　　金：国家自然科学基金项目(U1804151);河南省科技攻关计划项目(202102310310).

摘　　要：研究从炼钢等生产过程提炼出的含忽略工序和不相关并行机的混合流水车间调度问题,以最小化最大完工时间为目标,建立整数规划模型,并提出结合全局搜索、自适应遗传算法和候鸟优化的遗传候鸟优化算法以求解该模型。在算法中采用与处理时间相关的全局搜索和随机程序以获得初始种群,提出自适应交叉和变异操作改进遗传算法解,在迭代进程中,引入基于工件、机器和工序位3种邻域搜索结构的候鸟优化算法更新最佳解。仿真实验中将遗传候鸟优化算法的实验结果与几种启发式算法进行对比,证明了模型和算法的有效性。The hybrid flowshop scheduling problem with missing processes and unrelated parallel machines extracted from steelmaking and other production processes is studied.An integer programming model is formulated to minimize the maximum completion time,and a genetic migrating birds optimization algorithm based on the global search,self-adaptive genetic algorithm,and migrating birds optimization is proposed to solve the model.The initial population is obtained by the global search considering the machine processing time and random procedure.Then,self-adaptive crossover and mutation operators are developed to improve the solutions of the genetic algorithm.In the iterative process,migrating birds optimization combined with three neighborhood search structures based on the job,machine,and operation position is introduced to update the best solutions.Finally,the experimental results of the genetic migrating birds optimization algorithm are compared with several heuristic algorithms to prove the effectiveness of the proposed model and algorithm.

关 键 词：忽略工序 不相关并行机 混合流水车间 全局搜索 自适应遗传算法 领域搜索 最大完工时间 遗传候鸟优化算法 

分 类 号：TP39[自动化与计算机技术—计算机应用技术] TB49[自动化与计算机技术—计算机科学与技术]