检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:肖莹莹[1] 李伯虎[1,2] 庄长辉 柴旭东[2] 林廷宇[2]
机构地区:[1]北京航空航天大学自动化与电气工程学院,北京100191 [2]北京仿真中心,北京100854
出 处:《计算机集成制造系统》2015年第3期800-812,共13页Computer Integrated Manufacturing Systems
基 金:国家863计划资助项目(2011AA040502)~~
摘 要:针对云制造面向分布式供应链环境中的多品种定制问题,提出一种多目标生产运输优化调度模型和基于改进混合蛙跳算法的求解方法。该模型考虑供应链中的制造/供应两阶段,以及不同企业间的运输时间和成本,得到成本最小、时间最短、生产空闲率最小、订单延迟最小的调度方案。同时,该算法重新定义原有算法的核心操作算子以适应离散调度问题求解,并结合模拟退火和极值优化算法的特性,进一步改进离散域的混合蛙跳算法的局部搜索性能。通过项目调度标准测试集验证了该改进算法的性能,并以6个品种定制需求为案例,验证了所提模型与算法的有效性。To satisfy multi-variety customization demands under distributed supply chain in cloud manufacturing, a multi objective mathematical model of a two-echelon supply chain scheduling problem and a solving method named Modified Shuffled Frog Leaping (MSFL) algorithm were proposed. In this model, manufacturing planning was opti- mized with consideration of transport time and cost between different facilities, and the scheduling schemes of smal- lest cost, shortest time, minimum idleness probability and minimum order delay were obtained. Meanwhile, the core operating operators were redefined to adapt the discrete scheduling problem by MSFL, and the local search performance of SFL was improved by adding characteristics of simulated annealing algorithm and extremal optimization algo- rithm. A set of benchmark in project scheduling problem was selected to verify the performance of MSFL, and the customization requirements of six varieties was taken as cases to demonstrate the effectiveness of the scheduling model and MSFL.
关 键 词:供应链 生产调度 多品种定制 混合蛙跳算法 云制造
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.12.148.147