当前位置：
首页 资源下载
搜索资源 - flowshop scheduling
搜索资源列表
-
0下载：
用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data us
-
-
0下载：
Using Artificial Chromosomes in Genetic algorithm for scheduling flowshop
-
-
1下载：
实现作业调度机制，用动态规划解决流水作业调度问题-Implement job scheduling mechanism, flow-shop scheduling with dynamic programming to solve the problem
-
-
0下载：
FLOWSHOP调度问题的启发式算法FLOWSHOP scheduling heuristic algorithm-FLOWSHOP scheduling heuristic algorithm
-
-
0下载：
matlab遗传算法求解多目标问题，flowshop调度问题-matlab genetic algorithm for multi-objective problems, flowshop scheduling problem
-
-
0下载：
CDS(Campbell-Dudek-Simth)：是Johnson算法的扩展，被认为是好的具有鲁棒性的启发式算法。用于求解n-job，m-machine的流水作业调度问题；即n项作业都需要顺序进行m个工序，m个工序中，每道工序仅有一台机器，如何安排n项作业的加工先后关系。-CDS (Campbell-Dudek-Simth): an extension of the Johnson algorithm is considered robust heuristic algorithm is go
-
-
0下载：
两台计算机上安装了分别两个相同的处理器 P1 和 P2 . 现有N个任务（ jobs） J1, ... , JN 要在这两台台计算机上处理。每个任务 Ji 都被分成2个子任务 ji1 和 ji2 .这个问题相当于流水作业调度问题（这里的N个问题被分为了2N个问题，因此在流水作业调度问题中输入的任务数应为偶数，但考虑到能执行奇数个应用比较广发，则没有特殊规范要求），用动态规划算法解决：
n个作业{1,2，…，n}要在由2台机器M1和M2组成的流水线上完成加工。每个作业加工的顺序都是先在M1上加
-
-
0下载：
网上花店实现很多Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including flowshop and make the two categories, containing the test data us
-
-
3下载：
使用多目标优化算法解决多目标流水车间调度multi objective flowshop问题，其中main为主函数。-Using multi-objective optimization algorithms to solve multi-objective flow shop scheduling multi objective flowshop problem, where the main function main.
-
-
0下载：
Discrete Particle Swarm Optimization (DPSO)
Algorithm for Permutation Flowshop Scheduling to
Minimize Makespan
-
-
0下载：
multi objective flowshop scheduling using bee algorithm
-
-
0下载：
multi objective flowshop scheduling using simulated annealing algorithm
-
-
0下载：
流水作业调度问题的动态规划算法,流水作业调度问题要求确定这n个作业的最优加工顺序,使得从第一个作业在机器M1上开始加工,到最后一个作业在机器M2上加工完成所需的时间最少。-
Dynamic programming algorithm for flow shop scheduling problems, flow-shop scheduling problems required to determine the optimal processing sequence which n jobs
-
-
0下载：
Game theory-based integration of scheduling
with flexible and periodic maintenance planning
in the permutation flowshop sequencing problem
-
-
6下载：
求解置换流水车间调度问题，采用改进的粒子群算法，结合经典的调度案例，有甘特图。-For permutation flow shop scheduling problem, an improved particle swarm optimization, combining classical scheduling cases, there is a Gantt chart.
-
-
3下载：
双层编码的遗传算法优化Flowshop调度程序(Flowshop Scheduling Program Optimized by Double-Layer Coded Genetic Algorithms)
-
