搜索资源列表
zydu-matlab
- 用 MATLAB实现作业车间调度的遗传算法源程序，基本思路可供参考。希望对大家有所帮助。- Realization of job-shop scheduling based on genetic algorithm by using MATLAB soft. wish help to others.
daima
- 操作系统作业调度的算法，有磁带机和打印机-Operating system scheduling algorithm, there are tape drives and printers
greedy
- 用VS6.0实现的作业调度贪心算法。包含完整的源码及实验结果图。-Job scheduling with VS6.0 greedy algorithm implemented. Contains the complete source code and experimental results Fig.
JBC
- 这是一个关于作业调度的程序，包含了FCFS，SJF和HRN三种算法-Here is a job scheduling process, including the FCFS, SJF, and three algorithms HRN
DispatchAlgorithm
- 作业调度的分配回收算法 含有FCFS调度算法与SJF调度算法-Job scheduling algorithm for the distribution of recovery with the SJF scheduling algorithm with FCFS scheduling algorithm
SJPF
- 短作业优先调度算法，是指对短作业或短进程优先调度的算法。-Short job first scheduling algorithm, is a short work or short process of priority scheduling algorithm.
5_1
- 实现先来先服务FCFS、短作业优先SJF以及时间片轮转调度算法-To achieve a first-come first-served FCFS, SJF, and short operating time slice cycle priority scheduling algorithm
FIFO
- 在分页式虚拟存储系统中，当硬件发出“缺页中断”后，引出操作系统来处理这个中断事件。如果主存中已经没有空闲块，则可用FIFO页面调度算法把该作业中最先进入主存的一页调出，存放到磁盘上。然后再把当前要访问的页装入该块。调出和装入后都要修改页表中对应页的标志。 FIFO页面调度算法总是淘汰该作业中最先进入主存的那一页，因此可以用一个数组来表示该作业已在主存的页面。-In the paging virtual memory system, when the hardware was given a
tanxinzuoyediaodu
- C实现的一贪心算法的作业调度的算法，有完整的实验报告和运行说明-C implementation of a greedy algorithm for job scheduling algorithm, a complete test report and operating instructions
yichuan
- Matlab源码（关于车间作业调度问题的遗传算法）有中文解释-Matlab source code (on the job shop scheduling problem of the genetic algorithm) with Chinese explanations
Process-scheduling-algorithm-
- 先来先服务调度算法（FCFS）：每次调度都是从后备作业队列中，选择一个或多个最先进入该队列的作业，将它们调入内存，为它们分配资源、创建进程，然后放入就绪队列。在进程调度中采用FCFS算法时，这每次调度是从就绪队列中，选择一个最先进入该队列的进程，为之分配处理机，使之投入运行。该进程一直运行到完成或发生某事件阻赛后，才放弃处理机。 最短作业优先（SJF）：每次从后备队列中选择一个或若干个估计运行时间最短的作业，将它们调入内存运行。 -FCFS scheduling algorithm (F
0801563
- 用遗传算法解决作业车间调度问题。作业车间调度可描述为集合{J，M，Op，T}(其中:J代表工件，M代表机器，Op代表工序，T代表工件的加工时间)，即如何将工件的工序按照合理的顺序分配到机器上，以达到目标函数的要求。-Using Genetic Algorithm for Job Shop Scheduling Problems. Job shop scheduling can be described as a set {J, M, Op, T} (where: J on behalf of t
2
- 采用先来先服务（FCFS），最短作业优先（SJF）、响应比高者优先（HRN）的调度算法对输入进程进行调度；-Using the first come first served (FCFS), shortest job first (SJF), respond to than high preferred (HRN) scheduling algorithm for scheduling the input process
zuoyeiaodu
- 采用先来先服务（FCFS），最短作业优先（SJF）、响应比高者优先（HRN）的调度算法对输入进程进行调度；-Using the first come first served (FCFS), shortest job first (SJF), respond to than high preferred (HRN) scheduling algorithm for scheduling the input process
duanzuoye
- 多作业调度，这是大学上操作系统做的实验,相信很多人都可用的着!本实验模拟单处理器系统的进程调度，采用时间片轮转调度算法作为进程调度算法。-More job scheduling, which make the operating system on a university experiment, I believe many people are available to the! This experiment simulated a single processor system, pro
FCFSPSJF
- 设计程序模拟进程的先来先服务FCFS和短作业优先SJF调度过程。假设有n个进程分别在T1, … ,Tn时刻到达系统，它们需要的服务时间分别为S1, … ,Sn。分别采用先来先服务FCFS和短作业优先SJF进程调度算法进行调度，计算每个进程的完成时间，周转时间和带权周转时间，并且统计n个进程的平均周转时间和平均带权周转时间。-Design program to simulate the process of a first-come first-served FCFS and SJF short
fcfs--sjf--rr--hrn
- 进程调度算法，1.先来先服务\2.短作业优先\3.时间片轮转\4.响应比优先-Process scheduling algorithms, 1 first-come, first serve \ (2) short operating priority \ 3 round-robin \ 4 response than the first
Priority
- 调度算法： 1: FCFS 2: 时间片轮换 3: 优先级调度 4: 最短作业优先 -Scheduling algorithm: 1: FCFS 2: Time slice rotation 3: priority scheduling 4: shortest job first
job-scheduing--to-achieve
- 可以利用操作系统的调度算法，实现作业调度-You can use the operating system scheduling algorithm, job scheduling
caozuoxitong
- 操作系统实验！单道批处理系统作业调度，三级反馈队列调度算法，主存空间分配和回收等-OS experiment! Single-channel batch job scheduling system, three feedback queue scheduling algorithm, main memory space allocation and recycling