Description: 装配线调度问题，用C++实现，并使用文件读入测试数据-Assembly line scheduling problem, using C++ implementation, and use the file read test data Platform: |
Size: 345088 |
Author:cjj |
Hits:
Description: 关于流水线生产的调度计算问题，很通用的，希望给大家有点帮助-Calculated on the assembly line scheduling problem, it is common, want to give everyone a little help Platform: |
Size: 2048 |
Author:蔡磊 |
Hits:
Description: 本程序解决下列问题：利用动态规划算法实现装配线调度问题。
要求测试数据以文本文件的形式存储，
即所有的数据由文本文件读入。-This program addresses the following issues: the use of dynamic programming algorithm assembly line scheduling problem. requires test data to a text file is stored, that all data read from the text file. Platform: |
Size: 27648 |
Author:cai0538 |
Hits:
Description: 装配线调度问题
第一行一个数 N （ 2<=N<= 100 ），代表转配线上装配站的个数
第二行 N 个数，依次代表装配线 1 的第 k 个站装配产品所需时间。
第三行 N 个数，依次代表装配线 2 的第 k 个站装配产品所需时间。
第四行四个数 I1 I2 O1 O2 （ 1<= I1,I2,O2,O2 <= 100 ），代表进入装配线 1 、 2 和退出转配线 1 、 2 所花的时间。
第五行 N-1 个数，依次代表从装配线 1 的第 k 个站到转配线 2 的第 k+1 个站所需时间。
第六行 N-1 个数，依次代表从装配线 2 的第 k 个站到转配线 1 的第 k+1 个站所需时间。
输出：
共两行
第一行， T ，代表从产品进入到退出所需的总时间。
第二行 N 个数，依次代表产品所经过的装配线。
-Assembly line scheduling problem
The first line of a number of N (2 <= N <= 100), on behalf of the wiring on the switch to the number of assembly stations
N number of second line, followed by representatives of the assembly line 1, k-time station assembly products.
N the number of the third line, followed by the representative assembly of the first k-2 products, the time required for the assembly stations.
The fourth line four the number of I1 I2 O1 O2 (1 <= I1, I2, O2, O2 <= 100), representatives to the assembly line 1, 2 and exit
Switch wiring 1, 2, spent time.
N-1 fifth line number, followed by representatives from the assembly line 1, k-2 stations to switch to wiring the first time k+1 station.
Sixth line number N-1, followed by representatives from the assembly line 2, k-1 stations to switch to wiring the first time k+1 station.
Output:
A total of two lines
The first line, T, on behalf of exit from the product into the total time req Platform: |
Size: 1024 |
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: 利用java实现的装配线调度问题，简单易懂，有注释-Using java to achieve the assembly line scheduling problem, easy to understand, there are notes Platform: |
Size: 1024 |
Author:苏婷 |
Hits:
Description: 流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码，属于GreenSim团队原创作品，博客上发布的是不完全的源码，本人将其补充完成已成功运行，转载请注明GreenSim团队原创作品。-Pipelined job-shop scheduling problem can be described as follows: n tasks on the assembly line m processing stages, each stage has at least one machine and at least one stage there are multiple machines, and the same processing performance of each machine on the same stage , at every stage to complete each task are a process, each process of each task can be processed on any machine on the corresponding stage of the processing time of each process known tasks, all tasks required to determine the sort and every Distribution of the machine on a stage, making scheduling index (typically seek Makespan) Min. The following code is a Genetic Algorithm for Job Shop Scheduling Problem pipelined general MATLAB source code, original works belong GreenSim team, the blog post is incomplete source code, I will supplement has been successfully completed its operation, please indicate the original team GreenSim works. Platform: |
Size: 3072 |
Author:yyl |
Hits:
Description: 针对飞机装配线的加工任务调度问题设计了基于遗传算法的调度算法，包含一套启发式规则和一系列线边约束。-Task scheduling problem for processing aircraft assembly line designed scheduling algorithm based on genetic algorithm, comprising a set of heuristic rules and a series of line side constraints. Platform: |
Size: 77824 |
Author:许可 |
Hits:
Description: 流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工-Pipelined job shop scheduling problem can be described as follows: n tasks for the m-th stage processing on the assembly line, there is at each stage of the at least one machine with at least the presence of many machines a stage, and the same processing performance of each machine on the same stage , at each stage any machine each task required to complete a process, each process of each task can be processed in the respective stages Platform: |
Size: 3072 |
Author:chaoshuai |
Hits:
Search - Assembly line scheduling problem