Description: 用Lagrangian松弛法解jobshop调度问题,不错的文章，希望队大家有用-using Lagrangian relaxation method of jobshop scheduling problems, the article is true, We hope that the team useful Platform: |
Size: 258670 |
Author:张伟 |
Hits:
Description: 在一个多道程序设计系统中，实现“作业调度”的模拟。模拟程序的要求如下： 1．输入： 作业流文件，其中存储的是一系列待执行的作业信息，每个作业包括五个数据项：作业号，优先级，进入输入井时间（用一个整数表示，如10：10表示为1010），作业估计运行时间（单位：分钟），内存需求量。各数据项用空格隔开。 2．输出： 按照作业调度次序输出每一个作业流文件：“作业号”、“进入内存时间”、“作业完成时间”、“周转时间”；每行输出一个作业的信息。 计算出平均周转时间并输出。 3．作业调度算法： 短作业优先（作业估计运行时间最短的作业首先被调度）。 4．处理要求： 在两道环境下有多个作业； 程序运行时，首先提示输入测试文件的文件名； 输入文件名后，程序将读入文件中的有关数据，并按照最短作业优先调度算法对作业进行调度，作业被调度运行后不再退出（忽略进程调度或者可以认为进程调度采用的是先来先服务调度算法）； 假设内存容量为100K，存储管理方案为可变分区方式，且不允许在内存中移动作业。 -in a multi-program design system, and achieving a "Dispatch" the simulation. The simulation procedure is as follows : 1. Input : Job Flow document, which is stored in a series of operations to be implemented information, including five each operating data : the operations, priority, time to enter the input shaft (with an integer, as expressed to 10:10 1010), is estimated to run time (unit : minutes), the memory demand. The data item separated by a space. 2. Output : In accordance with the scheduling order of output per work- a document : "operations", "memory access time", "complete operational time", "turnaround time"; An output per line operating information. Calculate the average turnaround time and output. 3. Job Scheduling Algorithm : Platform: |
Size: 3072 |
Author:陈峰 |
Hits:
Description: 用Lagrangian松弛法解jobshop调度问题,不错的文章，希望队大家有用-using Lagrangian relaxation method of jobshop scheduling problems, the article is true, We hope that the team useful Platform: |
Size: 258048 |
Author:张伟 |
Hits:
Description: 车间调度问题主程序,需要进行自主参数设计-Shop scheduling problem the main program, the need for self-Parameter Design Platform: |
Size: 1024 |
Author:jack |
Hits:
Description: 由 P. Brucker, B. Jurisch, and B. Sievers提出的job shop scheduling解法程序，包含多种标准问题。-job shop scheduling method proposed by P. Brucker, B. Jurisch, and B. Sievers. Platform: |
Size: 156672 |
Author:承敏刚 |
Hits:
Description: 使用CDS(一种基于John算法的拓展算法)和Palmer算法解决m-machine和n-job 的jobshop schedling问题，并对主要的功能指标进行比较。使用Matlab运行调用Drawchat（）函数。-Use of CDS (algorithm based on the expansion of John algorithm) and Palmer algorithm to solve m-machine n-job and the jobshop schedling issues and the main features were compared. Run using the Matlab call Drawchat () function. Platform: |
Size: 32768 |
Author:ylh |
Hits:
Description: 这是另外一个基于工序的柔性作业车间调度的程序，简单易行-This is another process based on the flexible job-shop scheduling procedures, simple Platform: |
Size: 92160 |
Author: |
Hits:
Description: 使用遗传算法和粒子群算法共同解决混合车间作业调度问题的文章-The use of genetic algorithm and particle swarm algorithm to solve the articles of the Hybrid Job Shop Scheduling Problem Platform: |
Size: 458752 |
Author:崔洋洋 |
Hits:
Description: 模拟退火算法解决作业车间调度jobshop问题，以FT06问题为例说明，可产生甘特图，JSPmain是主函数。-Simulated annealing algorithm to solve the job shop scheduling jobshop problem to FT06 problem as an example, can produce a Gantt chart, JSPmain is the main function. Platform: |
Size: 5120 |
Author:chenzhen |
Hits:
Description: A Greedy heuristic for jobshop scheduling improvement with the objective of minimizing the maximum completion time (makespan) of jobs Platform: |
Size: 1024 |
Author:doben |
Hits:
Description: 能实现作业车间的调度，以及生产相应的甘特图(It can realize the scheduling of workshops and produce corresponding Gantt charts.) Platform: |
Size: 55296 |
Author:酥饼 |
Hits:
Search - jobshop scheduling