Welcome![Sign In][Sign Up]
Location:
Search - job shop scheduling code matlab

Search list

[Algorithmjobshop

Description: 车间调度问题主程序,需要进行自主参数设计-Shop scheduling problem the main program, the need for self-Parameter Design
Platform: | Size: 1024 | Author: jack | Hits:

[AI-NN-PRJSPGA

Description: 车间作业调度问题遗传算法Matlab源码 -Job-shop scheduling problem genetic algorithm source Matlab
Platform: | Size: 1024 | Author: hj | Hits:

[matlabche

Description: 车间作业调度问题Matlab源码,用于完成车间作业的最优化调度-Job Shop Scheduling Problem Matlab source code for the completion of Job Shop Scheduling Optimization
Platform: | Size: 2048 | Author: lucas | Hits:

[matlabJobShopSchedulingProblemMatlabGeneticAlgorithm

Description: 车间作业调度问题遗传算法Matlab源码,用于解决车间的调度问题-Job Shop Scheduling Problem Matlab genetic algorithm source code for the solution to the scheduling problem workshop
Platform: | Size: 2048 | Author: sxb | Hits:

[Software Engineeringjob-shop

Description: 基于PSO的job-shop调度源代码,上面已经上传了一个基于flow-shop调度问题,可以讲二者对比看-PSO-based job-shop scheduling of the source code has been uploaded above based on the flow-shop scheduling problem, you can talk about comparing the two to see
Platform: | Size: 16384 | Author: 杨维 | Hits:

[OtherGenetic

Description: 车间作业调度问题遗传算法Matlab源码-Genetic Algorithm for Job Shop Scheduling Problem Matlab source code
Platform: | Size: 5120 | Author: 曾行 | Hits:

[matlabShop-scheduling-genetic-algorithm

Description: 遗传算法车间调度,车间作业调度问题遗传算法 -------------------------------------------------------------------------- 输入参数列表 M 遗传进化迭代次数 N 种群规模(取偶数) Pm 变异概率 T m×n的矩阵,存储m个工件n个工序的加工时间 P 1×n的向量,n个工序中,每一个工序所具有的机床数目 输出参数列表 Zp 最优的Makespan值 Y1p 最优方案中,各工件各工序的开始时刻,可根据它绘出甘特图 Y2p 最优方案中,各工件各工序的结束时刻,可根据它绘出甘特图 Y3p 最优方案中,各工件各工序使用的机器编号 Xp 最优决策变量的值,决策变量是一个实数编码的m×n矩阵 LC1 收敛曲线1,各代最优个体适应值的记录 LC2 收敛曲线2,各代群体平均适应值的记录 最后,程序还将绘出三副图片:两条收敛曲线图和甘特图(各工件的调度时序图)-Genetic algorithm scheduling, job shop scheduling problems with genetic algorithms -------------------------------------------------------------------------- genetic evolution of the input parameter list, the number of iterations M N population size (taken even) Pm mutation probability T m × n matrix, stored m one piece n a process of processing time 1 × n vector, n a process in which each machine processes the number of Zp with the best value Y1p Optimal Makespan programs, the start time of each process the workpiece can be drawn based on its optimal solution Gantt Y2p, each time the workpiece end of the process, according to its draw Gantt Y3p optimal solution, each piece of the processes using machine code Xp optimal decision variable, decision variable is a real m × n matrix encoded LC1 convergence curve 1, the generation of the best individual record of LC2 fitness convergence curve 2, the average fitness value on behalf of groups record Finally, the program will draw three pict
Platform: | Size: 2048 | Author: 王龙隐 | Hits:

[AI-NN-PRyichuan

Description: Matlab源码(关于车间作业调度问题的遗传算法)有中文解释-Matlab source code (on the job shop scheduling problem of the genetic algorithm) with Chinese explanations
Platform: | Size: 2048 | Author: fo | Hits:

[matlabxiaofei_jsp

Description: 该程序是用MATLAB写的,用pso算法解决了6X6的车间调度问题,并绘制了甘特图,代码简单易学。-The program is written in MATLAB, a 6X6 with pso algorithm to solve the job shop scheduling problem, and draw a Gantt chart, the code is easy to learn.
Platform: | Size: 34816 | Author: XiaoFei | Hits:

[Otherjsp-ga-master

Description: 传统作业车间调度的遗传算法解算程序MATLAB源代码,产生最优调度结果。-Genetic algorithms traditional job-shop scheduling solver MATLAB source code, to produce optimal scheduling results.
Platform: | Size: 480256 | Author: 李广 | Hits:

[Otherchejiandiaodu

Description: 流水线型车间作业调度问题可以描述如下:n个任务在流水线上进行m个阶段的加工,每一阶段至少有一台机器且至少有一个阶段存在多台机器,并且同一阶段上各机器的处理性能相同,在每一阶段各任务均要完成一道工序,各任务的每道工序可以在相应阶段上的任意一台机器上加工,已知任务各道工序的处理时间,要求确定所有任务的排序以及每一阶段上机器的分配情况,使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码,属于GreenSim团队原创作品,博客上发布的是不完全的源码,本人将其补充完成已成功运行,转载请注明GreenSim团队原创作品。-Pipelined job-shop scheduling problem can be described as follows: n tasks on the assembly line m processing stages, each stage has at least one machine and at least one stage there are multiple machines, and the same processing performance of each machine on the same stage , at every stage to complete each task are a process, each process of each task can be processed on any machine on the corresponding stage of the processing time of each process known tasks, all tasks required to determine the sort and every Distribution of the machine on a stage, making scheduling index (typically seek Makespan) Min. The following code is a Genetic Algorithm for Job Shop Scheduling Problem pipelined general MATLAB source code, original works belong GreenSim team, the blog post is incomplete source code, I will supplement has been successfully completed its operation, please indicate the original team GreenSim works.
Platform: | Size: 3072 | Author: yyl | Hits:

[Internet-NetworkFJSP-NSGA2

Description: 基于NSGA2的柔性作业车间调度问题(FJSP-NSGA2)(Flexible job shop scheduling problem based on NSGA2 Matlab Code(FJSP-NSGA2))
Platform: | Size: 13312 | Author: 范特西pofi | Hits:

CodeBus www.codebus.net