搜索资源列表
E-shop
- E-Shopping using Data Mining, we can extract the items easily to shoppers based on data mining algorithm.-E-Shopping using Data Mining, we can extract the items easily to shoppers based on data mining algorithm.
source
- Job shop scheduling problem using genetic algorithm must use g++ complier
Example
- Flow Job Shop problem using genetic algorithm use g++ compiler
Example
- Flow job shop scheduling using BB method
Jobshopschedulingsimulatedannealinggeneticalgorith
- 车间作业调度的模拟退火遗传算法，可以用于一般生产性过程中的工序调度应用 -Job shop scheduling simulated annealing genetic algorithm
NEH_ForTFT
- 排序问题的NEH算法，用于解决最小总完工时间的无等待流水调度问题，是最有名的启发式算法-NEH algorithm is the best algorithm for serching the minimum total flow time of no wait flow-shop porblem
FSSP-of-GA
- Flow Shop调度问题的遗传算法通用MATLAB源码。 本源码由GreenSim团队原创，-Flow Shop Scheduling Problem General Genetic Algorithm MATLAB source code. The original source code from the GreenSim team,
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
4.tar
- 依据Johnson原则，应用贪心算法解决两处理机流水作业调度问题。注释详实，可读性好。-Johnson based on the principle of application of the greedy algorithm to solve the two processor flow-shop scheduling problem. Comments detailed, readable.
thms
- 差异作业批调度的流水车间问题及近似算法Differences in job batch scheduling of flow shop problems and approximation algorithms-Differences in job batch scheduling of flow shop problems and approximation algorithms
open-shop
- Open shop scheduling problem, it is common, want to give everyone a little help
A-job-shop-with-GA-method
- 用遗传算法解决一个np极难问题，即车间调度中的job shop问题。-With genetic algorithm is very difficult to solve a np problem, that is, the workshop dispatch of the job shop problem.
job-shop-with-changed-matrix
- 一个车间调度的程序，其独特之处在于可以任意输入测试矩阵进行测试。-A shop scheduling program, its unique in the input test matrix can be arbitrary test.
genetic-job-shop-matlab
- matlab 求解job shop scheduling problem 遗传算法 整数编码 双点交叉 溢出位修复-job shop scheduling problem genetic algorithm for integer encoding two-point cross-overflow bit repair
job-shop-matlab
- 带有恶化时间的作业车间调度问题matlab 程序-Job shop scheduling problem with time to progression matlab program
Barber-shop-simulation
- 数据结构设计程序之理发馆仿真，便于初学者-Barber shop simulation of the data structure design process, easy for beginners
JOB-SHOP-SCHEDULING
- 基于混合遗传算法问题车间调度优化(论文+源码),哈工大本科学生毕业论文,内有源码以及遗传算法和模拟遗传算法相关论文-Shop Scheduling with Genetic Algorithm
Shop-scheduling--ga_jsp
- 用遗传算法解决车间调度问题 aberrance.m 760 24-07-07|09:42 across.m 2144 26-07-07|16:35 cal.m 1133 20-05-08|08:37 calP.m 742 15-05-08|20:16 caltime.m 1986 25-07-07|10:52 JSP.m 4006 22-05-08|19:52 plotRec.m 487 14-07-07|14:48 车间调度遗传算法的研究.doc 8755
encode-and-decode-of-shop-job
- 用于车间调度的编码和解码。 encode函数用于生成M*N的编码数组。M为机器数，N为工件数。 Jm数组的行，表示对应工件在不同机器上的加工顺序。数组内容为机器号。 T数组为加工时间数组。第M行第N列，表示第N号工件在第M号机器上的加工时间。 程序采用先判断对应机器上是否有空间满足插空标准，处理后，再判断是否产生新的空间。 decode解码函数最终需要求得，在M个机器中，所用的最长时间，也就是最大完成时间，作为解码的结果。-For shop scheduling encodi
GA-for-flow-shop
- GA for flow shop,include GA and SMGA,need ga toolbox-GA and SMGA