欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对流水线调度这一类NP-Hard难题,深入分析了零空闲流水线调度问题,提出了一种解决零空闲流水线调度问题的基于NEH方法的禁忌搜索算法,建立了以工件的最大完工时间为目标的算法模型。新算法利用NEH启发式算法产生问题的初始解,改善了新算法的搜索性能。利用动态方式更新禁忌表长,提高了新算法的鲁棒性。为了提高算法的运行时效,利用快速搜索算法对提出的禁忌搜索算法进行改进,即采用快速搜索算法作为禁忌搜索的邻域函数,得到另一种改进的禁忌搜索算法。仿真试验结果表明了该算法的有效性及优越性,新算法在流水线生产调度及自动化工程等领域具有较高的实用价值。
英文摘要：
For NP-Hard scheduling problems,the no-idle flowshop scheduling problemis deeply analyzed.Then a tabu search algorithm based on the NEH method is proposed for the no-idle flowshop scheduling problem.And an algorithm model with the target of the maximum makespan is established.The new algorithm uses the NEH heuristic to generate the initial solution and this improves its searching performance.It updates the length of the tabu list dynamicly to improve the robustness of the new algorithm.In order to improve the efficiency of the algorithm it uses fast search algorithm to improve the proposed tabu search,that is,fast search algorithm as the neighborhood function of the tabu search.Then an improved tabu search algorithm is presented.Simulation results proved the effectiveness and superiority of the new algorithm.The practical value of the new algorithm is very high in the flowshop production scheduling field, automation engineering field and and so on.
同期刊论文项目
同项目期刊论文
A hybrid particle swarm optimization and tabu search algorithm for flexible job-shop scheduling prob
A novel hybrid evolutionary algorithm for the integrated model of collaborative planning and schedul
A hybrid Pareto-based local search algorithm for multi-objective flexible job shop scheduling proble
A novel hybrid harmony search algorithm for the no-wait flow shop scheduling problems with total flo
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Eucli
An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with inte
位置：