欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
结合车间调度问题本身的特点，采用关键路径块邻域结构，混合禁忌搜索算法和粒子群优化算法，设计了一种快速混合调度算法．该算法对预选择的块邻域解的性能进行快速估计，对不可行解尽早舍去，大大减小了邻域解的搜索空间．仿真结果表明，该算法在求解平均时间和性能方面均具备明显优势．
英文摘要：
The paper designed a fast hybrid algorithm for the job shop .scheduling problems. The feature of the job shop scheduling problem was considered, and block neighbor .solutions based on critical path was used in it, tabu search algorithm and particle swarm optimization were all included in it. A new function was created to quickly estimate the performance of the candidate .solutions, and drop the bad ones, so it can decrease the search space deeply. A simulation indicates that the new algorithm has good efficiency and performance.
同期刊论文项目
同项目期刊论文
A hybrid variable neighborhood search algorithm for solving multi-objective flexible job shop proble
An ensemble of discrete differential evolution algorithms for solving the generalized traveling sale
A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop sc
Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithm
An effective hybrid quantum-inspired evolutionary algorithm for parameter estimation of chaotic syst
Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stag
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
位置：