搜索资源列表
flowshop
- 实现作业调度机制，用动态规划解决流水作业调度问题-Implement job scheduling mechanism, flow-shop scheduling with dynamic programming to solve the problem
Two-processor_flow-shop_scheduling
- 两处理机流水作业调度实现两处理机间流水作业调度问题-To achieve the two processor flow-shop scheduling flow shop scheduling problem between the two processors
matlab-for-Flow-Shop-Scheduling
- 将matlab用来求解流水车间调度源程序-Flow Shop Scheduling source will be used to solve matlab
liushuizuoyediaodu
- 两台计算机上安装了分别两个相同的处理器 P1 和 P2 . 现有N个任务（ jobs） J1, ... , JN 要在这两台台计算机上处理。每个任务 Ji 都被分成2个子任务 ji1 和 ji2 .这个问题相当于流水作业调度问题（这里的N个问题被分为了2N个问题，因此在流水作业调度问题中输入的任务数应为偶数，但考虑到能执行奇数个应用比较广发，则没有特殊规范要求），用动态规划算法解决： n个作业{1,2，…，n}要在由2台机器M1和M2组成的流水线上完成加工。每个作业加工的顺序都是先在M1上加
liushuichejiandiaoduwenti-matlab
- 基于遗传算法的流水车间调度问题代码，非常实用-Based on Genetic Algorithm for Flow Shop Scheduling code
Flow-shop-scheduling-problem
- 代码实现的是流水作业调度问题的解决，流水作业调度问题是经典的算法问题。-Code is to solve the flow-shop scheduling problems, flow-shop scheduling problem is a classical algorithm for the problem.
parallel-ga
- Solving flow shop scheduling problem using a parallel genetic algorithm
flow-shop-scheduling
- flow shop 的文档 简单易懂 容易上手很实用-flow shop
BBO
- bbo算法是一种优化算法，可以解决流水车间调度问题，望大家下载学习-bbo algorithm is an optimization algorithm, flow shop scheduling problem can be resolved, we hope to learn download
Flow-Job-with-NEH-initilization
- This Code source resoudre Flow-shop Problem. we use the GA algorithm with NEH initialzation algorithm.
FlowOperation.cpp
- 给定n个作业，每个作业有两道工序，分别在两台机器上处理。一台机器一次只能处理一道工序，并且一道工序一旦开始就必须进行下去直到完成。一个作业只有在机器1上的处理完成以后才能由机器2处理。假设已知作业i在机器j上需要的处理时间为t[i,j]。流水作业调度问题就是要求确定一个作业的处理顺序使得尽快完成这n个作业。-Given n jobs, each job prescribe procedures were handled on both machines. A machine can only h
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
flowshop
- Development of a heuristic for the flow shop problem
Flowshop--PSO
- 求解置换流水车间调度问题，采用改进的粒子群算法，结合经典的调度案例，有甘特图。-For permutation flow shop scheduling problem, an improved particle swarm optimization, combining classical scheduling cases, there is a Gantt chart.
Johnson
- 计算Flow Shop调度问题及最优结果所用时间(Compute the Flow Shop scheduling problem and the time taken for the optimal results)
新建文件夹
- 混合流水车间的调用函数的MATLAB代码(The MATLAB code of the calling function of the mixed flow shop)
NEH.m
- 1.NEH principle (1) the processing time of each workpiece on all machines is summed; the summed values are sorted from large to small; (2) first select the first workpiece (the longest processing time), with the second workpiece into the first wo
入门学习资料
- 包含plant simulation基础教程以及一个流水车间仿真示例包含源文件(Contains plant simulation basic tutorials and a flow shop simulation example, including source files)
Mixed flow shop with multiprocessor
- 带多处理器的混合流水车间集合，同样试用于JSP作业车间(Mixed flow shop with multiprocessor)
PPNGA+SFLA_V3.0
- 这个是混合蛙跳算法做流水车间调度问题，能够很好的解决该类问题，此代码比较简单，适合初学者。(This is a shuffled frog leaping algorithm for flow shop scheduling problem. It can solve this problem very well. This code is relatively simple and suitable for beginners.)