Search - scheduling

Search - scheduling - List

[CSharp] czxt_1 DL : 0: 基于dos的多任务系统的实现通过对线程的创建和撤销,cpu的调度,同步机制,通信机制的实现.-based multi-tasking system of the threads through the creation and withdrawn, cpu scheduling, synchronization mechanisms, communication mechanisms to achieve.
Date : 2008-10-13 Size : 2.57kb User : 沈扬
[CSharp] 作业调度11 DL : 0: 由于在单道批处理系统中，作业一投入运行，它就占有计算机的一切资源直到作业完成为止，因此调度作业时不必考虑它所需要的资源是否得到满足，它所占用的CPU时限等因素。每个作业由一个作业控制块JCB表示，JCB包括如下信息：作业名、提交时刻、所需运行时间、所需资源、作业状态、链指针等。在程序开始时对用户提交的作业按作业调度算法排列，用链表形式存储，这里分别采用先来先服务、短作业、响应比高者优先调度算法对作业进行调度。这里为了操作者的方便，每个作业无论所需运行时间多少，都是每敲一次键盘就执行完一个作业。每个作业完成后打印作业的开始运行时刻，完成时刻，周转时间和带权周转时间，一组作业完成后打印这组作业的平均周转时间，带权周转时间。所以要在运行时对运行时间进行记录，这里设置几个全局变量：T时间量； ttime总周转时间； trtime总的带权周转时间。-Road due to the single-batch system, and put into operation an operation, it has all the resources of the computer until the operation is completed, the dispatch operation when it's not necessary to consider whether the resources needed to be met, it occupied by the CPU time and other factors. Each operation by operating a control block JCB, JCB include the following information : operations, and submitted moment, the run time, the resources required, operational state, chain pointer. At the beginning of the procedure to users of operations by scheduling algorithm with using forms Chain store, were used here first-come first-serve, short operations, response is high priority scheduling algorithm scheduling of the operation. Here in order to facilitate the operation of each operation ir
Date : 2008-10-13 Size : 3.56kb User : 江大
[CSharp] 如意餐厅小助手 DL : 1: 这是一个用C#和SQL Server 2000编写的餐厅管理系统软件.由四个模块组成:前台收银模块,点菜模块,橱房调度模块,管理模块.-This is a C# and SQL Server 2000 prepared by the restaurant management system software. From four modules : prospects cashier module, module orders, Side scheduling module, management module.
Date : 2008-10-13 Size : 652.4kb User : 丁一
[CSharp] ji99i DL : 0: 是一个有动画界面的车厢调度问题。因为大多数学生在学数据结构是遇到问题，本程序能为他们做参考-is an animation interface compartment scheduling problem. Because the majority of students in the data structure of the problems encountered, the procedure can be done for them reference
Date : 2008-10-13 Size : 4.43kb User : king
[CSharp] fenjidiaodu DL : 0: 操作系统进程调度中的分级调度...自己试着编了个..大家看看指出不足-operating system process scheduling classification scheduling ... .. Bianlegan own try to see that we lack
Date : 2008-10-13 Size : 1.82kb User : 晓亮
[CSharp] 火车调度 DL : 1: 这是一个VC编写的火车调度程序，实际上是数据结构栈的应用，同时设计到递归的应用。-This is a VC prepared by the train scheduling procedures, data structure is actually the application stack, recursive design to the application.
Date : 2008-10-13 Size : 2.4kb User : 王小雪
[CSharp] 7班25号娄娟 DL : 0: 先来先服务调度算法、最高响应比调度算法、时间片轮转调度算法的实现-first-come first-service scheduling algorithm, the maximum response than scheduling algorithm, time-Cycle Scheduling Algorithm Implementation
Date : 2008-10-13 Size : 495.77kb User : 娄娟
[CSharp] os_2 DL : 0: 本程序需要用到数据结构中队列的概念完成。用指针指出下一个进程的PCB首地址，最后一个进程中指针为“0”。该调度算法是从后备队列中选择一个或若干个估计运行时间最短的作业，将其调入内存运行。当要求运行时间不为0时，将PCB加入队列（按优先数大小插入，且置队首标志）；若要求运行时间为0，则把它的状态修改为“结束”（），并退出队列。-the procedures need to resort to queue data structure to complete the concept. Using indicators under a process that the PCB first address, the final process of a target to "0." The scheduling algorithm from the reserve queue is a choice among a number of estimates or the shortest run the operation, the redeployment of its memory operation. When asked for running time 0:00 a.m., the PCB will join the queue (by inserting small number of priority, but the first signs of home team); if the running time to 0, ruled the state to "end" (), and to withdraw from the queue.
Date : 2008-10-13 Size : 1.06kb User : 紫水晶
[CSharp] 完整的进程的调度1 DL : 1: 最经典的进程调度算法山东科技大学版权所有-classic scheduling algorithm in the process of Shandong University of Science and Technology |
Date : 2008-10-13 Size : 2.68kb User : 张永涛
[CSharp] 要求 DL : 0: 本程序是一个操作系统关于进程调度的程序，其中有，进程的优先权和先进先出等模拟调度功能-this process is a process of the operating system on the activation procedures, which, the process priority and FIFO scheduling simulation
Date : 2008-10-13 Size : 1.38mb User : 帅哥
[CSharp] railk DL : 0: 最优车皮排序问题 .问题描述：在一个列车调度站中，k 条轨道连接到k 条侧轨处，形成k 个铁路转轨栈，从左到右依次记为H1，H2，…，Hk 如下图所示。其中左边轨道为车皮入口（记为H0），右边轨道为出口（记为Hk+1），编号为a1, a2,.,an 的n 个车皮从入口依次进入转轨栈，由调度室安排车皮进出栈次序，并对车皮按其出栈次序重新排序为1，2，…，n。调度室在安排车皮进出栈次序时，遵循以下规则：（1）车皮入口H0 处的车皮可以进入转轨栈H1，H2，…，Hk 之一，或直接进入车皮出口Hk+1 。（2）转轨栈H1，H2，…，Hk 处的车皮可以进入车皮出口Hk+1 。 .编程任务：给定正整数n，和n 个车皮的初始编号a1, a2,.,an ，编程计算最少需要多少个转轨栈才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n 的顺序输出。 .数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n 个车皮的初始编号a1, a2,.,an 。-wagon optimal scheduling problem. Problem description : In a train station, k, k track connected to the side of the tracks, forming k stack rail transition from left to right followed credited to H1, H2, ..., Hk as in the figure below. Which left orbit for imported cars (credited to H0), the right track for exports (credited as a Hk), the No. a1, a2,. , An n-wagon from the entrance into the transition stack followed by the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to the order reordering of 1,2, ..., n. The dispatch room in arranging access stack wagon order, to abide by the following rules : (1) H0 wagon entrance of cars can enter the transition stack H1, H2, ..., Hk, or directly into a wagon export Hk. (2) Transition stack H1, H2, ..., H
Date : 2008-10-13 Size : 29.49kb User : 无翼
[CSharp] railqk DL : 0: 最优平行轨道车皮排序问题 .问题描述：在一个列车调度站中，k 条轨道平行连接到1 条侧轨处，形成1 条主轨道和k-1 条辅助调度轨道。主轨道记为Hk，辅助轨道从下到上依次记为H1，H2，…，Hk-1 如下图所示。其中主轨道左边为车皮入口（记为H0），主轨道右边为出口（仍记为Hk）。编号为a1, a2,L,an 的n 个车皮从入口依次进入主轨道，由调度室安排车皮进出轨次序，并对车皮按其出轨次序重新排序为1，2，…，n。调度室在安排车皮进出轨次序时，遵循以下规则：（1）车皮入口H0 处的车皮可以进入辅助轨道H1，H2，…，Hk-1 之一，或直接进入车皮出口Hk。（2）辅助轨道H1，H2，…，Hk-1 处的车皮可以进入车皮出口Hk。 .编程任务：给定正整数n，和n 个车皮的初始编号a1, a2,L,an ，编程计算最少需要多少个平行轨道才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n 的顺序输出。 .数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n 个车皮的初始编号a1, a2,L,an 。 .结果输出: 将计算出的最少平行轨道数输出到文件output.txt 。-optimal parallel tracks wagon scheduling problem. Problem description : In a train station, k parallel track connected to a side track, the formation of a main track and k-assisted dispatching an orbit. The main track is recorded as Hk, auxiliary track from the next turn of the last recorded as H1, H2, ..., Hk-1 are shown in Fig. Including the main track entrance to the left of the wagon (credited to H0), the main track of the right to export (still recorded as Hk). No. a1, a2, L, an n-wagons from the main entrance into orbit followed by the dispatch room arrangements into cars derailed priorities, as well as cars derailed according to reorder priorities 1,2, ..., n. Room scheduling arrangements in order wagon into the derailment, to abide by the following rules : (1) H0 wagon entrance of
Date : 2008-10-13 Size : 61.08kb User : stzxxxstz
[CSharp] 作业调度11 DL : 0: 由于在单道批处理系统中，作业一投入运行，它就占有计算机的一切资源直到作业完成为止，因此调度作业时不必考虑它所需要的资源是否得到满足，它所占用的CPU时限等因素。每个作业由一个作业控制块JCB表示，JCB包括如下信息：作业名、提交时刻、所需运行时间、所需资源、作业状态、链指针等。在程序开始时对用户提交的作业按作业调度算法排列，用链表形式存储，这里分别采用先来先服务、短作业、响应比高者优先调度算法对作业进行调度。这里为了操作者的方便，每个作业无论所需运行时间多少，都是每敲一次键盘就执行完一个作业。每个作业完成后打印作业的开始运行时刻，完成时刻，周转时间和带权周转时间，一组作业完成后打印这组作业的平均周转时间，带权周转时间。所以要在运行时对运行时间进行记录，这里设置几个全局变量：T时间量； ttime总周转时间； trtime总的带权周转时间。-Road due to the single-batch system, and put into operation an operation, it has all the resources of the computer until the operation is completed, the dispatch operation when it's not necessary to consider whether the resources needed to be met, it occupied by the CPU time and other factors. Each operation by operating a control block JCB, JCB include the following information : operations, and submitted moment, the run time, the resources required, operational state, chain pointer. At the beginning of the procedure to users of operations by scheduling algorithm with using forms Chain store, were used here first-come first-serve, short operations, response is high priority scheduling algorithm scheduling of the operation. Here in order to facilitate the operation of each operation ir
Date : 2026-01-11 Size : 3kb User : 江大
[CSharp] +c++ DL : 0: c++磁盘调度算法 c++磁盘调度算法-c disk scheduling algorithm c c disk scheduling algorithm disk scheduling algorithm
Date : 2026-01-11 Size : 1kb User : 5837499
[CSharp] bxjdd DL : 0: 解决了并行机调度问题，本题采用穷举法与随机法相结合的方法求解，可取得最优解。-Solve the parallel machine scheduling problem, the problem using exhaustive method, the optimal solution can be achieved.
Date : 2026-01-11 Size : 1kb User : langlang
[CSharp] Scheduling DL : 0: 用C#和C++实现的进程调度算法程序（操作系统实验）本实验通过编写C#语言的代码实现先来先服务（FCFS），最短作业优先（SJF）、响应比高者优先（HRN）的调度算法。最后在界面上显示出进程在调度过程中的情况。另附上C++的进程调度实验，算法不相同。-Use C# and C++ to build up a project to achieve process scheduling.The project contains the algorithm of FCFS,SJF and HRN.
Date : 2026-01-11 Size : 21kb User : 威
[CSharp] Class-scheduling-genetic-algorithm DL : 0: The Class Scheduling Problem (CSP) is concerned with assigning a number of courses corresponding to various students and instructors to classrooms taking into consideration constraints like classroom capacities and university regulations. The problem also attempts to optimize the performance criteria and distribute the courses fairly to classrooms depending on the ratio of classroom capacities to course enrollments. The problem is a classical scheduling problem and considered to be NP‐ complete. It has received some research during the past few years given its wide use in colleges and universities. Several formulations and algorithms have been proposed to solve scheduling problems, most of which are based on local search techniques. In this project, we use a hybrid algorithm which combines features of Genetic algorithm and Branch and Bound algorithm to solve the class scheduling problem. -The Class Scheduling Problem (CSP) is concerned with assigning a number of courses corresponding to various students and instructors to classrooms taking into consideration constraints like classroom capacities and university regulations. The problem also attempts to optimize the performance criteria and distribute the courses fairly to classrooms depending on the ratio of classroom capacities to course enrollments. The problem is a classical scheduling problem and considered to be NP‐ complete. It has received some research during the past few years given its wide use in colleges and universities. Several formulations and algorithms have been proposed to solve scheduling problems, most of which are based on local search techniques. In this project, we use a hybrid algorithm which combines features of Genetic algorithm and Branch and Bound algorithm to solve the class scheduling problem.
Date : 2026-01-11 Size : 41kb User : masmur
[CSharp] Process-scheduling-algorithms DL : 0: 进程的调度算法，感觉挺好的，与大家分享一下-The process scheduling algorithm, I feel very good to share with you
Date : 2026-01-11 Size : 2kb User : 随风
[CSharp] vehicle-scheduling DL : 0: 这是一个本科毕业论文的程序，利用免疫进化算法来解决物流企业车辆调度的问题，供参考。-This is an undergraduate thesis program, the use of immune evolutionary algorithm to solve the logistics vehicle scheduling problem, for reference.
Date : 2026-01-11 Size : 22.57mb User : 任勇军
[CSharp] shop-scheduling-system DL : 1: 此车间调度系统软件只适合在包含类库为Net FrameWork 4.5版本的Windows系统中运行，能够完成基于四种调度规则的车间多机调度问题，四种规则为SPT、LPT、EDD+SPT、FCFS+SPT。-This shop scheduling system is only suitable for containing a class library for.net FrameWork 4.5 version of the Windows in the system operation, can complete workshop of scheduling rules based on four kinds of multimachine scheduling problem, four rules for SPT, LPT, EDD+ SPT, FCFS+ SPT.
Date : 2026-01-11 Size : 4.96mb User : 夏天

« 12 3 4 5 6 7 8 9 10 »