Description: the matlab implementation of job-shop scheduling problem solution based on the GA algorithm Platform: |
Size: 50611 |
Author:froglce |
Hits:
Description: 车间调度问题主程序,需要进行自主参数设计-Shop scheduling problem the main program, the need for self-Parameter Design Platform: |
Size: 1024 |
Author:jack |
Hits:
Description: 车间作业调度问题遗传算法Matlab源码,用于解决车间的调度问题-Job Shop Scheduling Problem Matlab genetic algorithm source code for the solution to the scheduling problem workshop Platform: |
Size: 2048 |
Author:sxb |
Hits:
Description: 这是实现操作系统交通灯调度问题，里面不是很好，希望大家提出宝贵的意见-This is the realization of operating system scheduling problem of traffic lights, which is not very good, hope that the valuable advice Platform: |
Size: 1753088 |
Author:chenjuan |
Hits:
Description: A survey to describe some Job Shop Scheduling problem using Genetic Algorithm problems to solve some NP-hardness problem! Platform: |
Size: 267264 |
Author:eric |
Hits:
Description: 车间作业调度问题遗传算法通用Matlab程序,很好用的的哦-the matlab implementation of job-shop scheduling problem solution based on the GA algorithm. Platform: |
Size: 51200 |
Author:朱磊 |
Hits:
Description: 机器排序问题，使用机会约束规划，其中变量使用的是模糊变量。-Machine scheduling problems, the use of chance-constrained programming, in which the variable using fuzzy variables. Platform: |
Size: 1024 |
Author:hj |
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: 一个简单的调度问题。我们的工作给予的J1，J2的...若，与已知运行时间为T1，T2 ...总氮，分别所有。我们只有一个处理器。什么是最好的方式来安排这些工作，以尽量减少平均完成时间。假定它是一个非抢占的调度：一旦开始工作，它必须运行完毕-A simple scheduling problem. We are given jobs j1, j2… jn, all with known running times t1, t2… tn, respectively. We have a single processor. What is the best way to schedule these jobs in order to minimize the average completion time. Assume that it is a nonpreemptive scheduling: once a job is started, it must run to completion. Platform: |
Size: 1024 |
Author:13081196 |
Hits:
Search - scheduling problem