Description: 基于流水车间的调度程序算法，适用于一般的流水机械加工车间调度-based on the water plant scheduler algorithm, applicable to the general flow machining shop scheduling Platform: |
Size: 53248 |
Author:曹战 |
Hits:
Description: 流水车间调度遗法，支持窗口输入主要的控制参数，和仿真图及收敛曲线。-Flowshop scheduling survived by law, to support the importation of the main window of the control parameters, and simulation and the convergence curve of Fig. Platform: |
Size: 26624 |
Author:athen |
Hits:
Description: 用贪心算法解决aflow 有调整时间的流水作业调度问题。-Greedy algorithm used to solve aflow have time to adjust the flowshop scheduling problem. Platform: |
Size: 1024 |
Author:yan |
Hits:
Description: 用c++实现的批处理作业调度问题·优先队列式分支限界法·回溯法，包括Flowshop和make两个类，含有测试用的数据data-With c++ Realized the issue of batch job scheduling priority queue-style backtracking branch and bound method, including Flowshop and make the two categories, containing the test data used in data Platform: |
Size: 264192 |
Author:刘斌 |
Hits:
Description: 两台计算机上安装了分别两个相同的处理器 P1 和 P2 . 现有N个任务（ jobs） J1, ... , JN 要在这两台台计算机上处理。每个任务 Ji 都被分成2个子任务 ji1 和 ji2 .这个问题相当于流水作业调度问题（这里的N个问题被分为了2N个问题，因此在流水作业调度问题中输入的任务数应为偶数，但考虑到能执行奇数个应用比较广发，则没有特殊规范要求），用动态规划算法解决：
n个作业{1,2，…，n}要在由2台机器M1和M2组成的流水线上完成加工。每个作业加工的顺序都是先在M1上加工，然后在M2上加工。M1和M2加工作业i所需的时间分别为ai,bi,1<=i<=n。流水作业调度问题要求确定这n个作业的最优加工顺序，使得从第一个作业在机器M1上开始加工，到最后一个作业在机器M2上加工完成所需的时间最少。-Two computers installed on the respectively two identical processors P1 and P2. The existing N tasks (JOBS) J1, ..., JN on these two computer processing. Each task Ji is divided into two sub-task ji1 and ji2 of this problem is equivalent to flowshop scheduling problem (the the N problem here is divided into 2N problem, so enter the number of tasks in the flow shop scheduling problem is even But taking into account the implementation of an odd number of applications GF, no special regulatory requirements), using a dynamic programming algorithm to solve: n jobs {1,2, ..., n} to the assembly line consisting of two machines M1 and M2 processing. Each job processing sequence is first processed on M1, then processed on M2. M1 and M2 processing operations i of the time required respectively ai, bi, 1 < = i < = n. The flowshop scheduling requirements determine the optimal processing sequence of n jobs, so start processing from the first job in the machine M1, to the last job on machine M2 Platform: |
Size: 2048 |
Author: |
Hits:
Description: CDS(Campbell-Dudek-Simth)：是Johnson算法的扩展，被认为是好的具有鲁棒性的启发式算法。用于求解n-job，m-machine的流水作业调度问题；即n项作业都需要顺序进行m个工序，m个工序中，每道工序仅有一台机器，如何安排n项作业的加工先后关系。-CDS (Campbell-Dudek-Simth): an extension of the Johnson algorithm is considered robust heuristic algorithm is good. Used to solve the n-job, m-machine flowshop scheduling problem the n tasks require the order of m processes m a process, each process is just a machine, how to arrange the the n job processing has relationship . Platform: |
Size: 1024 |
Author:郁小芳 |
Hits:
Description: 使用多目标优化算法解决多目标流水车间调度multi objective flowshop问题，其中main为主函数。-Using multi-objective optimization algorithms to solve multi-objective flow shop scheduling multi objective flowshop problem, where the main function main. Platform: |
Size: 22528 |
Author:chenzhen |
Hits:
Description: 流水作业调度问题的动态规划算法,流水作业调度问题要求确定这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, so the first job starts working on the machine M1, to the last machining operation on the machine M2 required to complete the minimum time. Platform: |
Size: 1024 |
Author:guowanwan |
Hits:
Description: Game theory-based integration of scheduling
with flexible and periodic maintenance planning
in the permutation flowshop sequencing problem Platform: |
Size: 998400 |
Author:abdo2017 |
Hits:
Search - flowshop scheduling