检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张志英[1] 林晨[1] 杨连生[1,2] 薛士枚 刘建峰
机构地区:[1]同济大学机械与能源工程学院,上海201804 [2]上海外高桥造船有限公司,上海200137 [3]上海江南长兴造船有限责任公司,上海201913
出 处:《上海交通大学学报》2014年第3期382-387,393,共7页Journal of Shanghai Jiaotong University
基 金:国家自然科学基金资助项目(70872076);上海科技创新行动计划资助项目(11dz1121803);江苏省南通市2010AA科技创新计划(工业)项目(AA2010048)
摘 要:基于船舶分段涂装作业,提炼出具有重入和等待时间约束的两阶段混合流水车间调度问题.其中第一阶段含多台批处理机,第二阶段含多台离散机且存在一次重入过程,两阶段间有等待时间约束.以最小化最大完工时间为优化目标建立数学模型,提出一种结合Metropolis抽样准则和变邻域搜索的混合量子粒子群优化算法,并利用多种启发式规则进行解码.实例验证和数值分析表明,所提算法是解决分段涂装调度问题的一种有效方法.A two-stage hybrid flow shop scheduling problem with reentrant and limited waiting time con straints was presented based on block painting operations. The first stage contained several identical batc hing machines which were able to process multiple jobs simultaneously, and the second stage contained several identical discrete machines. Minimization of the makespan was used as the optimization objective to build a mathematical model. A hybrid quantum-behaved particle swarm optimization algorithm combined with Metropolis rule and variable neighborhood search was proposed. The heuristic decoding strategy was developed to generate the scheduling scheme. Application and numerical analysis indicated that the pro- posed algorithm was an effective solution to the problem of block painting scheduling.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15