期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Discrete Artificial Bee Colony Algorithm for Lot-streaming Flowshop with Total Flowtime Minimization 被引量:8
1
作者 SANG Hongyan GAO Liang pan quanke 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2012年第5期990-1000,共11页
Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a numb... Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony (DABC) algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop. 展开更多
关键词 lot-streaming flowshop scheduling artificial bee colony algorithm total flowtime
在线阅读 下载PDF
基于问题特征知识的迭代贪心算法求解多目标零等待流水车间调度问题
2
作者 何轩 潘全科 高亮 《机械工程学报》 北大核心 2025年第4期344-354,共11页
零等待流水车间调度问题在现实生活中有广泛的应用,研究其求解方法是非常有必要的。现有文献大多仅考虑一个生产调度指标。然而,实际问题往往是多目标的。因此,以同时优化最大完工时间和总流经时间为目标,提出一种问题特征知识指导搜索... 零等待流水车间调度问题在现实生活中有广泛的应用,研究其求解方法是非常有必要的。现有文献大多仅考虑一个生产调度指标。然而,实际问题往往是多目标的。因此,以同时优化最大完工时间和总流经时间为目标,提出一种问题特征知识指导搜索的迭代贪心调度算法。首先,使用混合整数规划模型中目标转化为约束的方法验证两个目标的冲突性。然后,分析并提取问题特征知识,设计极值搜索过程估计参考点。针对最大完工时间目标,将其转化为非对称旅行商问题,使用动态规划局部优化调度序列。针对总流经时间指标,利用支配准则指导的局部搜索进行确定性的优化。最后,为有效执行具有问题特征指导的局部搜索,使用锥形标量加权方法将两个优化目标转化为一个优化目标。大量仿真试验表明了所提方法的有效性。 展开更多
关键词 零等待流水车间调度 多目标优化 动态规划 支配准则 迭代贪心
原文传递
A new latency-reducing and energy-efficient protocol for the wireless sensor network
3
作者 XIONG Junjie QU Yugui +2 位作者 LIN Huahui pan quanke ZHAO Baohua 《Frontiers of Electrical and Electronic Engineering in China》 CSCD 2007年第2期144-150,共7页
This paper introduces a new protocol routing medium access control(RMAC)that integrates the routing and medium access control(MAC)layer protocol.They can both reduce latency and save energy in the wireless sensor netw... This paper introduces a new protocol routing medium access control(RMAC)that integrates the routing and medium access control(MAC)layer protocol.They can both reduce latency and save energy in the wireless sensor network(WSN)while most others propose protocols that sacrifice latency for energy.To make RMAC fit WSN better,we designed an easy and efficient routing protocol base station flooding(BSF)and then integrated it with a MAC protocol timing out MAC(TMAC)[1],while traditionally BSF and TMAC work separately at two layers.We call this two-layer protocol(TLP).We theoretically proved the advan-tages of RMAC over TLP and evaluated RMAC over NS-2.The simulation results show that RMAC spends half the latency of TLP,as well as consumes less energy than TLP. 展开更多
关键词 WSN MAC ROUTING energy efficient latency-reducing
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部