搜索资源列表
Shop-scheduling-genetic-algorithm
- 遗传算法车间调度,车间作业调度问题遗传算法 -------------------------------------------------------------------------- 输入参数列表 M 遗传进化迭代次数 N 种群规模(取偶数) Pm 变异概率 T m×n的矩阵,存储m个工件n个工序的加工时间 P 1×n的向量,n个工序中,每一个工序所具有的机床数目 输出参数列表 Zp 最优的Makespan值 Y1p 最优方案
0801563
- 用遗传算法解决作业车间调度问题。作业车间调度可描述为集合{J,M,Op,T}(其中:J代表工件,M代表机器,Op代表工序,T代表工件的加工时间),即如何将工件的工序按照合理的顺序分配到机器上,以达到目标函数的要求。-Using Genetic Algorithm for Job Shop Scheduling Problems. Job shop scheduling can be described as a set {J, M, Op, T} (where: J on behalf of t
matlab-GA-JSP
- matlab遗传算法解决车间调度问题,适用于一般问题-matlab genetic algorithm to solve job shop scheduling problem, the problem for general
job-shop-GA
- 利用实数编码,实现车间调度的遗传算法代码-Job-shop GA
PSO solve JSP
- 用粒子群算法求解车间调度问题,包含甘特图的制作程序(Particle swarm optimization algorithm for job shop scheduling problem, including Gantt chart)
chapter17
- 遗传算法有较强的问题解决能力,这个地方用他解决车间调度问题(Genetic algorithm has a strong problem solving ability, this place uses it to solve the job shop scheduling problem)
用pso算法解决了6X6的车间调度问题
- 采用粒子群优化算法解决6*6车间调度问题(Solving job shop scheduling with PSO)
车间调度
- 车间调度问题的程序,已经调度通过,能够运行(program of JSP, the program can run, is matlab program)
代码-多层编码遗传算法的车间调度算法
- 智能算法中的遗传算法,解决多层编码车间调度问题(The genetic algorithm in intelligent algorithm solves the problem of multilayer coding shop scheduling.)
Untitled6
- 对车间调度用遗传算法求解,使用matlab软件进行分析(Genetic algorithm for job shop scheduling)
生产调度matlab
- 基于遗传算法的车间调度的MATLAB实现,很好改进,实用(MATLAB implementation of job shop scheduling based on genetic algorithm is very good and practical.)
matlab_gatt
- matlab甘特图生产车间调度问题流水线问题并行机调度问题等(MATLAB for gatt)
遗传算法 车间调度 甘特图 代码
- 修改了网上不对的程序,可以用遗传算法求解。并画出甘特图(Modified the wrong program on the Internet, which can be solved by genetic algorithm. And draw Gantt chart.)
柔性车间调度遗传算法matlab实现代码
- 柔性车间调度遗传算法matlab实现代码,针对于多目标问题的matlab代码实现柔性车间调度遗传算法matlab实现代码
4db781413c19dc9a5948a312484c62d2
- 主要是基于柔性作业车间调度的遗传算法求解(It is mainly based on the genetic algorithm of flexible job shop scheduling)
蜂群算法
- 多目标柔性作业车间调度问题(Multiobjective Flexible Job-shop Scheduling Problem, MFJSP)是复杂的 NP-hard 问题,相较于基础的车间调度问题更符合实际情况,求解难度也相对较高。,该算法主要通过模拟蜜蜂的觅食来解决实际问题。由于 ABC 算法具有搜索速度快、精度高、鲁棒性强等优点,在车间调度领域得到广泛应用。(Multiobjective Flexible Job-shop Scheduling Problem, MFJSP)
NSGA2车间调度算法
- 该算法是一般NSGA2在车间调度问题上的应用(This algorithm is the application of general NSGA2 in job shop scheduling problem)
代码
- 用蚁群算法原理解决多任务多车间车间调度问题(Solving the multi task and multi workshop scheduling problem with the principle of ant colony algorithm)
混合NSGA-Ⅱ算法求解多目标柔性作业车间调度问题
- 混合NSGA-Ⅱ算法求解多目标柔性作业车间调度问题(Hybrid NSGA -II algorithm for multi-objective flexible job shop scheduling)
0cb728ca
- 使用NSGA2求解作业车间调度问题,可以运行,亲测有效(Using NSGA2 to solve job shop scheduling problem)