基于深度强化学习与迭代贪婪的流水车间调度优化 |
您所在的位置：网站首页 › 贪婪的最终结果 › 基于深度强化学习与迭代贪婪的流水车间调度优化 |
|
1. Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms
[J] .
Shao Weishi,
Pi Dechang,
Shao Zhongshi
Knowledge-Based Systems
.
2017,第deca1期
机译：迭代贪婪算法优化分布式无等待流水车间调度问题的制造时间 2. An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem [J] . Ding Jian-Ya, Song Shiji, Gupta Jatinder N. D., Applied Soft Computing . 2015,第Null期机译：改进的迭代贪婪算法和基于禁忌的重构策略，用于无等待流水车间调度问题 3. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion [J] . Quan-Ke Pan, Ling Wang, Bao-Hua Zhao The International Journal of Advanced Manufacturing Technology . 2008,第8期机译：一种基于makepan准则的无等待流水车间调度问题的改进迭代贪婪算法 4. Iterated Greedy Algorithm for Solving a Hybrid Flow Shop Scheduling Problem with Reentrant Jobs [C] . Qi Zhang, Zheng Tian, Sen Wang, Chinese Control and Decision Conference . 2020机译：带可重入工作的混合流水车间调度问题的迭代贪婪算法 5. Permutation flow-shop scheduling using a genetic algorithm-based iterative method. [D] . Eskenasi, Mahdi. 2006机译：使用基于遗传算法的迭代方法进行置换流水车间调度。 6. Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling [O] . Qifang Luo, Yongquan Zhou, Jian Xie, -1机译：离散蝙蝠算法的置换流水车间调度优化问题 7. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem [O] . Rubén Ruiz, Thomas Stützle 2006机译：一种简单有效的迭代流水车间调度问题迭代贪心算法 8. Stochastic Flow Shop Scheduling of Overlapping Jobs on Tandem Machines inApplication to Optimizing the U.S. Army's Deliberate Nuclear, Biological, and Chemical Decontamination Process, (Final Report) [R] . Novikov, V. 1991机译：随机流水车间调度应用于串联机器上的重叠工作，以优化美国陆军故意的核，生物和化学净化过程，（最终报告） |
| CopyRight 2018-2019 办公设备维修网 版权所有 豫ICP备15022753号-3 |