Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - scheduling problem
Search - scheduling problem - List
the matlab implementation of job-shop scheduling problem solution based on the GA algorithm
Date : 2012-11-26 Size : 49.42kb User : froglce

DL : 0
车间调度问题主程序,需要进行自主参数设计-Shop scheduling problem the main program, the need for self-Parameter Design
Date : 2025-07-13 Size : 1kb User : jack

DL : 1
车间作业调度问题遗传算法Matlab源码 -Job-shop scheduling problem genetic algorithm source Matlab
Date : 2025-07-13 Size : 1kb User : hj

经典的Job Shop问题调度算法,用Visual C++语言实现。 -Job Shop Scheduling Problem
Date : 2025-07-13 Size : 275kb User : 肖乔

DL : 0
车间作业调度问题Matlab源码,用于完成车间作业的最优化调度-Job Shop Scheduling Problem Matlab source code for the completion of Job Shop Scheduling Optimization
Date : 2025-07-13 Size : 2kb User : lucas

车间作业调度问题遗传算法Matlab源码,用于解决车间的调度问题-Job Shop Scheduling Problem Matlab genetic algorithm source code for the solution to the scheduling problem workshop
Date : 2025-07-13 Size : 2kb User : sxb

DL : 0
这是实现操作系统交通灯调度问题,里面不是很好,希望大家提出宝贵的意见-This is the realization of operating system scheduling problem of traffic lights, which is not very good, hope that the valuable advice
Date : 2025-07-13 Size : 1.67mb User : chenjuan

A survey to describe some Job Shop Scheduling problem using Genetic Algorithm problems to solve some NP-hardness problem!
Date : 2025-07-13 Size : 261kb User : eric

车间作业调度问题遗传算法通用Matlab程序,很好用的的哦-the matlab implementation of job-shop scheduling problem solution based on the GA algorithm.
Date : 2025-07-13 Size : 50kb User : 朱磊

DL : 0
车间作业调度问题遗传算法Matlab源码-Genetic Algorithm for Job Shop Scheduling Problem Matlab source code
Date : 2025-07-13 Size : 5kb User : 曾行

用蚁群算法解决无等待流水线的调度问题,对生产调度建模及求解有帮助.-solving scheduling problem with ANT Algorithm
Date : 2025-07-13 Size : 264kb User : John

机器排序问题,使用机会约束规划,其中变量使用的是模糊变量。-Machine scheduling problems, the use of chance-constrained programming, in which the variable using fuzzy variables.
Date : 2025-07-13 Size : 1kb User : hj

一种求解Job-Shop调度问题的 混合自适应变异粒子群算法 -Solving Job-Shop scheduling problem by hybrid particle swarm optimization with adaptive mutation
Date : 2025-07-13 Size : 130kb User : sunhua

mechine scheduling problem
Date : 2025-07-13 Size : 1kb User : 张震

project scheduling problem
Date : 2025-07-13 Size : 2kb User : 张震

本程序解决下列问题:利用动态规划算法实现装配线调度问题。  要求测试数据以文本文件的形式存储,  即所有的数据由文本文件读入。-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.
Date : 2025-07-13 Size : 27kb User : cai0538

装配线调度问题 第一行一个数 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
Date : 2025-07-13 Size : 1kb User : 李延明

一个简单的调度问题。我们的工作给予的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.
Date : 2025-07-13 Size : 1kb User : 13081196

对任意给定的整数N和K,以及完成任务I需要的时间为Ti,i=1至N设计一个优先队列式分支限界法,计算完成这N个任务的最佳调度-Batch scheduling problem
Date : 2025-07-13 Size : 3kb User : hmy

用贪心算法解决多级调度问题,用C++语言实现-Greedy algorithm for multi-machine scheduling problem
Date : 2025-07-13 Size : 1kb User : 张张
« 12 3 4 5 6 7 8 9 10 ... 31 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.