Description: 多机调度问题要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。 这个问题是NP安全问题，到目前为止还没有有效的解法。对于这一类问题，用贪心选择策略有时可以设计出较好的近似算法。-machine scheduling problems required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing completed. The problem is NP security issues, so far no effective solution. For this type of issue, greedy strategy can sometimes choose to design a better approximation algorithm. Platform: |
Size: 1024 |
Author:姚翊 |
Hits:
Description: 带有期限的作业排序问题：假定只能在一台机器上处理n个作业，每个作业均可在单位时间内完成；又假定每个作业i都有一个截止期限di>0(它是整数)，当且仅当作业i在它的期限截止以前被完成时，则获得pi>0的效益。求具有最大效益值的可行解。
文件中包含详细的源代码和注释，以实现这个经典的问题。-period with the operations scheduling problem : the assumption that only a machine n handling operations, each of the operating units can be completed within time; Also assume that each job i have a deadline di Platform: |
Size: 1024 |
Author:agang |
Hits:
Description: 这是算法分析当中的一个经典问题，可以利用贪心算法来实现两台机器的调度问题，通过程序可以使两台工作的机器的调度达到最优-This is the algorithm analysis includes a classic problem, greedy algorithm can be used to achieve the two-machine scheduling problem adoption of procedures to enable the two machines to achieve optimal scheduling Platform: |
Size: 40960 |
Author:阳林 |
Hits:
Description: 最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。
-Optimal scheduling problem, assuming that n has a mission by the k-parallel machine to complete the work. I need to complete the mission time for ti. Try to design an algorithm to find n complete this task the best scheduling, making the time to complete a full first mission. Platform: |
Size: 1024 |
Author:朱亚华 |
Hits:
Description: 机器调度是指有m台机器要处理n个作业，设作业i的处理时间为ti，则对n个作业进行机器分配，使得：
(1)一台机器在同一时间内只能处理一个作业；
(2)一个作业不能同时在两台机器上处理；
(3)作业i一旦运行，则需要ti个连续时间单位。
设计算法进行合理调度，使得在m台机器上处理n个作业所需要的处理时间最短。
-Machine scheduling is the m-machine has to deal with n-operations, set up the processing time for operation i for ti, while operations on the n-machine allocation, makes: (1) a machine at the same time one can only deal with operations (2) an operation at the same time should not deal with the two machines (3) operating i once run, you need ti consecutive time units. Rational design of scheduling algorithm, making the m machine n-deal operation required the shortest processing time. Platform: |
Size: 49152 |
Author:lq |
Hits:
Description: 假定只能在一台机器上处理n个作业 ，每个作业 有一个处理时间 ，利润 和截止时间 。机器一次只能处理一个作业，作业 必须不间断地运行 个连续时间单位。如果作业 在它的截止时间 之前完成，则得利润 ，但如果作业在截止时间之后完成，则得利润为0。假设所有处理时间为 之间的整数，最大利润作业调度问题要求确定个n作业的一个子集，使得该子集中作业调度所获得的利润最大。-Assumed that only one machine n-deal operations, each operation has a processing time, profits and cut-off time. Machines can only handle one operation, operation must be run uninterrupted consecutive time units. If operating in its cut-off time to complete, then a profit, but if the operation was completed after the cut-off time, then a profit is 0. Assume that all processing time is between the integers, the greatest profit job scheduling problems require the identification of a n a subset of operations, making the sub-centralized job scheduling the biggest profits. Platform: |
Size: 1024 |
Author:me |
Hits:
Description: 基于RTlinux平台的实时多任务调度策略，运
用模块化的设计方法，编制了程序解释模块、速度过渡模块、插补和运动学算法模 块、人机接口模块和伺服驱动模块，并实现了面向用户的软PLC功能 。-RTLinux-based platform for real-time multi-task scheduling strategy, using modular design methods, the preparation of the procedures explained module, the speed of the transition module, interpolation and kinematics algorithm module, man-machine interface module and servo drive modules, and to achieve a user-oriented soft PLC functions. Platform: |
Size: 5111808 |
Author:li |
Hits:
Description: 基本遗传算法的C语言源程序。（遗传算法的应用范围极其广泛，它可应用于函数优化、组合优化、生产调度问题、自动控制、机器人学、图像处理、人工生命、遗传编程以及机器学习等领域。）-Basic genetic algorithm C language source code. (Genetic algorithm extremely broad range of applications, it can be applied to function optimization, combinatorial optimization, production scheduling problem, automatic control, robotics, image processing, artificial life, genetic programming, as well as machine learning and other fields.) Platform: |
Size: 3072 |
Author:沁篱 |
Hits:
Description: 解决了并行机调度问题，本题采用穷举法与随机法相结合的方法求解，可取得最优解。-Solve the parallel machine scheduling problem, the problem using exhaustive method, the optimal solution can be achieved. Platform: |
Size: 1024 |
Author:langlang |
Hits:
Description: 算法设计中经典的批处理作业调度问题，是多机器多任务的调度-Algorithm design in the classic problem of a batch job scheduling, multi-tasking is a multi-machine scheduling Platform: |
Size: 3072 |
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: 基于作业调度的算法代码,机器加工零件有时长、优先级等因素限制，要求在一定时间内完成。-Scheduling algorithm based on the code, machine parts and sometimes a long process, priority and other factors limit, requiring some time to complete. Platform: |
Size: 13312 |
Author:wangyu |
Hits:
Description: 最佳调度问题，假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-Optimal scheduling problem, assuming there are n a task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design a complete algorithm to find the optimal scheduling of tasks n, make the time to complete all tasks first. Platform: |
Size: 1024 |
Author:李晓明 |
Hits:
Description: 遗传算法车间调度,车间作业调度问题遗传算法
--------------------------------------------------------------------------
输入参数列表
M 遗传进化迭代次数
N 种群规模(取偶数)
Pm 变异概率
T m×n的矩阵，存储m个工件n个工序的加工时间
P 1×n的向量，n个工序中，每一个工序所具有的机床数目
输出参数列表
Zp 最优的Makespan值
Y1p 最优方案中，各工件各工序的开始时刻，可根据它绘出甘特图
Y2p 最优方案中，各工件各工序的结束时刻，可根据它绘出甘特图
Y3p 最优方案中，各工件各工序使用的机器编号
Xp 最优决策变量的值，决策变量是一个实数编码的m×n矩阵
LC1 收敛曲线1，各代最优个体适应值的记录
LC2 收敛曲线2，各代群体平均适应值的记录
最后，程序还将绘出三副图片：两条收敛曲线图和甘特图（各工件的调度时序图）-Genetic algorithm scheduling, job shop scheduling problems with genetic algorithms -------------------------------------------------------------------------- genetic evolution of the input parameter list, the number of iterations M N population size (taken even) Pm mutation probability T m × n matrix, stored m one piece n a process of processing time 1 × n vector, n a process in which each machine processes the number of Zp with the best value Y1p Optimal Makespan programs, the start time of each process the workpiece can be drawn based on its optimal solution Gantt Y2p, each time the workpiece end of the process, according to its draw Gantt Y3p optimal solution, each piece of the processes using machine code Xp optimal decision variable, decision variable is a real m × n matrix encoded LC1 convergence curve 1, the generation of the best individual record of LC2 fitness convergence curve 2, the average fitness value on behalf of groups record Finally, the program will draw three pict Platform: |
Size: 2048 |
Author:王龙隐 |
Hits:
Search - Scheduling Machine