搜索资源列表
sdasd
- 车间作业调度问题遗传算法，可以生成调度甘特图。-Job-shop scheduling problem genetic algorithm, can generate Gantt scheduling.
JobShopSchedulingProblemMatlabGeneticAlgorithm
- 车间作业调度问题遗传算法Matlab源码,用于解决车间的调度问题-Job Shop Scheduling Problem Matlab genetic algorithm source code for the solution to the scheduling problem workshop
SurveyPresent
- A survey to describe some Job Shop Scheduling problem using Genetic Algorithm problems to solve some NP-hardness problem!
matlab-GA-JSP
- matlab遗传算法解决车间调度问题,适用于一般问题-matlab genetic algorithm to solve job shop scheduling problem, the problem for general
Genetic-algorithm-problem
- 车间作业调度问题遗传算法,程序还将绘出三副图片：两条收敛曲线图和甘特图（各工件的调度时序图）-Genetic algorithm for job shop scheduling problem, the program will draw three pictures: two convergent graphs and Gantt (schedule timing diagram of the workpiece)
Fortran
- A genetic algorithm in Fortran for solving a two-agent job scheduling problem.
genetic-job-shop-matlab
- matlab 求解job shop scheduling problem 遗传算法 整数编码 双点交叉 溢出位修复-job shop scheduling problem genetic algorithm for integer encoding two-point cross-overflow bit repair
JSP--E-T--GA
- 针对带有交货期窗口硬约束，并对提前/拖期零件进行惩罚的一类作业车间调度问题，设计了一种改进型遗传算法EGA。交货期窗口硬约束是指每个零件均有交货期和deadline，零件可以在交货期后完工，但绝不能超出deadline。EGA采用“逆向后推”和“顺向前拉”相结合的两阶段求解策略。针对部分染色体在解码过程中违反交货期窗口硬约束而产生非法解的问题，采用基于关键路径的染色体修复方法来调整染色体基因序列，以期实现在满足交货期窗口硬约束的同时降低零件拖期成本；在保持第一调度阶段拖期成本不变的基础上，采用基
-Problem
- 一种求解多目标柔性Job Shop调度的改进遗传算法-An improved genetic algorithm for multi-objective Flexible Job Shop Scheduling Problem
GA
- 这是一个遗传算法文件，用于解决车间调度问题-This document is a genetic algorithm for solving job shop scheduling problem
chejiandiaodu
- 流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码，属于GreenSim团队原创作品，博客上发布的是不完
GA- job shop scheduling
- genetic algorithm for job shop scheduling problem
生产调度
- 多工序多设备的生产车间调度问题，采用的是精英保留策略的遗传算法(A genetic algorithm based on elite reservation strategy is adopted for multi-process and multi-equipment job shop scheduling problem.)