Search - scheduling

Search - scheduling - List

[Mathimatics-Numerical algorithms] 01a DL : 0: 数学建模-公交车调度问题论文（维普阅读器）-mathematical modeling-bus scheduling problem thesis (Wei-pu readers)
Date : 2008-10-13 Size : 2.88mb User : 钟天
[Mathimatics-Numerical algorithms] 调度 DL : 0: 一个用vc编写的调度算法程序-vc prepared with a scheduling algorithm procedures
Date : 2008-10-13 Size : 1.45kb User : 韩鹏
[Mathimatics-Numerical algorithms] diaodu DL : 0: 磁盘调度设计，磁盘调度算法的实现，包括  先来先服务调度算法  最短寻道优先调度算法  扫描算法  循环扫描算法  N—Step—SCAN算法-Disk Scheduling design, disk scheduling algorithm, including
Date : 2026-01-09 Size : 2kb User : 姚军
[Mathimatics-Numerical algorithms] 进程调度模拟程序 DL : 0: 操作系统进程调度模拟程序vc实现-operating system simulation process scheduling procedures to achieve vc
Date : 2026-01-09 Size : 2kb User : 梁山东
[Mathimatics-Numerical algorithms] acm程序 DL : 1: acm亚洲区竞赛的一个题目（关于任务调度的）以及我的程序实现Asia Regional_Taipei Site Dec.10-13.1999Program EBroadcast Scheduling -acm Asia a topic of race (on the task scheduling), and I realize the procedures Asia Regional_Taipei Site GC.6/Dec.10- 13.1999Program EBroadcast Scheduling
Date : 2026-01-09 Size : 19kb User : 付治钧
[Mathimatics-Numerical algorithms] TwoMachinesFastWork DL : 0: 这是算法分析当中的一个经典问题，可以利用贪心算法来实现两台机器的调度问题，通过程序可以使两台工作的机器的调度达到最优-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
Date : 2026-01-09 Size : 40kb User : 阳林
[Mathimatics-Numerical algorithms] 7 DL : 0: 1. 最早截止时间优先EDF（Earliest DeadlineFirst）算法是非常著名的实时调度算法之一。在每一个新的就绪状态，调度器都是从那些已就绪但还没有完全处理完毕的任务中选择最早截止时间的任务，并将执行该任务所需的资源分配给它。在有新任务到来时，调度器必须立即计算EDF，排出新的定序，即正在运行的任务被剥夺，并且按照新任务的截止时间决定是否调度该新任务。如果新任务的最后期限早于被中断的当前任务，就立即处理新任务。按照EDF算法，被中断任务的处理将在稍后继续进行。 -1. The first priority deadline for EDF (Earliest DeadlineFirst) algorithm is a very famous one in real-time scheduling algorithm. In every state of readiness for a new, scheduler from those already in place but has not fully dealt with the mandate to select the earliest deadline for the task, and the implementation of the tasks required for the allocation of resources to it. In the arrival of new tasks, the scheduler must immediately calculate EDF, from the new sequencing, that is the task of running was curtailed, and new tasks in accordance with the deadline for deciding whether to dispatch the new tasks. If the new mission as early as the deadline for the immediate task was interrupted immediately to deal with new tasks. In accordance with the EDF algorithm, the task was interrupted to deal with will be at a later date to continue.
Date : 2026-01-09 Size : 2kb User : wjx
[Mathimatics-Numerical algorithms] YCSFMatlab DL : 1: 车间作业调度问题用遗传算法解决的通用Matlab程序-Job-shop scheduling problem using genetic algorithms to solve the generic Matlab procedures
Date : 2026-01-09 Size : 3kb User : jianglu
[Mathimatics-Numerical algorithms] GS DL : 0: 实现网格中含有依赖任务调度的GS算法，其中根据任务在各个机器上的执行时间和任务之间的依赖关系来计算出任务的调度顺序-The realization of the grid containing the GS-dependent task scheduling algorithm, in which the task in accordance with the implementation of the various machines on time and task-dependent relationship between the task scheduler to calculate the order of
Date : 2026-01-09 Size : 4kb User : 吴明
[Mathimatics-Numerical algorithms] multiantenna DL : 0: On the optimality of multiantenna broadcast scheduling using
Date : 2026-01-09 Size : 475kb User : selinoz
[Mathimatics-Numerical algorithms] constrain DL : 2: 基于改进粒子群算法的节能调度下多目标负荷最优分配 -Particle swarm optimization based on improved energy-saving scheduling optimal allocation under the multi-objective particle swarm optimization based on improved energy-efficient multi-objective scheduling optimal allocation under
Date : 2026-01-09 Size : 2kb User : 余开江
[Mathimatics-Numerical algorithms] juangpeixian DL : 1: 装配线调度问题第一行一个数 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 : 2026-01-09 Size : 1kb User : 李延明
[Mathimatics-Numerical algorithms] Batch-scheduling-problem DL : 0: 对任意给定的整数N和K，以及完成任务I需要的时间为Ti，i=1至N设计一个优先队列式分支限界法，计算完成这N个任务的最佳调度-Batch scheduling problem
Date : 2026-01-09 Size : 3kb User : hmy
[Mathimatics-Numerical algorithms] Disk-scheduling DL : 0: 磁盘调度算法，包含FCFS，SSTF，SCAN和CSCAN-Disk scheduling algorithms, including FCFS, SSTF, SCAN and CSCAN
Date : 2026-01-09 Size : 477kb User : 踏雪
[Mathimatics-Numerical algorithms] thms DL : 0: 差异作业批调度的流水车间问题及近似算法Differences in job batch scheduling of flow shop problems and approximation algorithms-Differences in job batch scheduling of flow shop problems and approximation algorithms
Date : 2026-01-09 Size : 551kb User : tao
[Mathimatics-Numerical algorithms] ALGORITHMS-FOR-TASK-SCHEDULING-IN-HETEROGENEOUS-C DL : 0: Thesis : ALGORITHMS FOR TASK SCHEDULING IN HETEROGENEOUS COMPUTING ENVIRONMENTS
Date : 2026-01-09 Size : 468kb User : Hamid
[Mathimatics-Numerical algorithms] Disk-scheduling- DL : 0: 编程序实现下述磁盘调度算法,并求出每种算法的平均寻道长度： 1、先来先服务算法（FCFS） 2、最短寻道时间优先算法（SSTF） 3、扫描算法（SCAN） 4、循环扫描算法（CSCAN）-Disk scheduling
Date : 2026-01-09 Size : 198kb User : jhy
[Mathimatics-Numerical algorithms] multiprocess-scheduling DL : 0: 进程调度得使用，可以看看。不错得算法。可以看看。不错得算法。-multiprocess scheduling
Date : 2026-01-09 Size : 40kb User : sosan
[Mathimatics-Numerical algorithms] Machine-Scheduling-Problem DL : 0: Machine Scheduling Problem
Date : 2026-01-09 Size : 1kb User : 呀呀呀啊啊
[Mathimatics-Numerical algorithms] scheduling DL : 0: 本作业分为两个子问题：第一个子问题是通过简化原来制造系统通过分步的思想来制定最优的调度计划；第二个子问题是通过简化工业4.0制造系统中通过整合的思想来制定最优的调度计划和设备维护计划。(The assignment is divided into two sub-problems: The first sub-problem is to develop an optimal scheduling plan by simplifying the original manufacturing system through step-by-step thinking. The second sub-problem is formulated by simplifying the idea of integration in the Manufacturing 4.0 manufacturing system Optimal scheduling plan and equipment maintenance plan.)
Date : 2026-01-09 Size : 5kb User : 阳光男孩_LHKF

« 12 3 4 5 6 7 »