文件名称:liushuizuoyediaodu
介绍说明－－下载内容均来自于网络，请自行研究使用
两台计算机上安装了分别两个相同的处理器 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
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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
liushuizuoyediaodu.cpp