检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:袁帅鹏 李铁克[1,2] 王柏琳[1,2] YUAN Shuaipeng;LI Tieke;WANG Bailin(School of Economics and Management,University of Science and Technology Beijing,Beijing 100083,China;Engineering Research Center of MES Technology for Iron&Steel Production,Ministry of Education,Beijing 100083,China)
机构地区:[1]北京科技大学经济管理学院,北京100083 [2]钢铁生产制造执行系统技术教育部工程研究中心,北京100083
出 处:《计算机集成制造系统》2022年第12期3912-3922,共11页Computer Integrated Manufacturing Systems
基 金:国家自然基金资助项目(71231001,71701016);北京市自然科学基金资助项目(9174038);中央高校基本科研业务费资助项目(FRF-BD-20-16A)。
摘 要:针对无关并行机类型的混合流水车间成组调度问题,在考虑序列相关准备时间的情况下,以最小化最大完工时间为目标建立混合整数线性规划模型,结合问题特征提出一种改进的候鸟优化算法。算法对工件组间排序、各工件组内工件间排序、各工件组在各阶段上并行机指派3个子问题进行统一编码,基于负载均衡思想和改进的先到先得策略将染色体解码为问题的可行解;根据编码特征设计了不同的邻域搜索机制来构造邻域结构,并提出一种协同优化的邻域解生成策略。通过不同规模的数据实验和与对比算法的比较分析,验证了所提算法的高效性和稳健性。Aiming at the hybrid flowshop group scheduling problem with unrelated parallel machines and sequence-dependent setup time,a mixed integer linear programming model for minimizing the makespan was established.Then an Enhanced Migrating Birds Optimization(EMBO)algorithm was proposed based on the characteristics of the problem.In EMBO,the three sub-problems,namely group scheduling,job scheduling within each group,and assignment of jobs on each stage were uniformly coded,and a decoding method was designed based on the idea of load balancing and improved first-come-first-served strategy.According to the coding characteristics,the different neighborhood structures and a co-optimized neighborhood solution generation strategy were proposed.Experiments with various problem scales and comparisons with other algorithms were carried out,and the results verified the efficiency and robustness of the proposed algorithm.
关 键 词:混合流水车间成组调度 无关并行机 序列相关准备时间 候鸟优化算法 协同优化
分 类 号:TH165[机械工程—机械制造及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.122