搜索资源列表
flowshop
- 离散算法，硕士论文一部分，希望对大家有所帮助。-Discrete Algorithms, part of a master's thesis, we want to help.
FlowShop
- java实现批处理作业调度算法 开发环境为Eclipse
flowshop.rar
- 采用遗传算法，可用此方法求解flowshop问题,Using genetic algorithms, this method can be used to solve the problem flowshop
FlowShop
- 用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
FlowShop
- 批处理作业调度 回溯法 c++语言编写的批处理作业调度问题算法-flowshop
coding_flowshop
- this is matlab file for permutation flowshop problem with cross entropy
flowshop
- 实现作业调度机制，用动态规划解决流水作业调度问题-Implement job scheduling mechanism, flow-shop scheduling with dynamic programming to solve the problem
d4ef13.ZIP
- FLOWSHOP调度问题的启发式算法FLOWSHOP scheduling heuristic algorithm-FLOWSHOP scheduling heuristic algorithm
sched_flowshop
- 在c++环境下用cplex解决flowshop问题-c++ using cplex for flowshop
1452
- matlab遗传算法求解多目标问题，flowshop调度问题-matlab genetic algorithm for multi-objective problems, flowshop scheduling problem
CDS
- 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
liushuizuoyediaodu
- 两台计算机上安装了分别两个相同的处理器 P1 和 P2 . 现有N个任务（ jobs） J1, ... , JN 要在这两台台计算机上处理。每个任务 Ji 都被分成2个子任务 ji1 和 ji2 .这个问题相当于流水作业调度问题（这里的N个问题被分为了2N个问题，因此在流水作业调度问题中输入的任务数应为偶数，但考虑到能执行奇数个应用比较广发，则没有特殊规范要求），用动态规划算法解决： n个作业{1,2，…，n}要在由2台机器M1和M2组成的流水线上完成加工。每个作业加工的顺序都是先在M1上加
mofsp-flowshop
- 使用多目标优化算法解决多目标流水车间调度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.
flow-shop-problem
- 使用遗传算法来来解决求解置换流水线问题算法-matlab code for flowshop problem to use genetic algorithms
ba
- multi objective flowshop scheduling using bee algorithm
sa
- multi objective flowshop scheduling using simulated annealing algorithm
flowshop
- 流水作业调度问题的动态规划算法,流水作业调度问题要求确定这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
NEH_F002
- 改进的NEH 算法求解no-wait flowshop 问题，复杂度降低为n^2m-Improved NEH algorithm for no-wait flowshop problem, the complexity is reduced to n ^ 2m
flowshop
- my third upload for flowshop
双层编码的遗传算法优化Flowshop调度程序
- 双层编码的遗传算法优化Flowshop调度程序(Flowshop Scheduling Program Optimized by Double-Layer Coded Genetic Algorithms)