Description: 有m台不同的机器，n个不同的工件。每个工件有多道工序，每道工序由指定的机器在固定的时间内完成。一道工序一旦开始处理，就不能中断。每台机器一次只能处理一道工序。一个调度就是决定每台机器上工序的处理顺序，使得机器完成所有工件的时间最短。具体的，该问题就是要求在满足（1）、（2）两个约束条件的前提下，确定每台机器上工序的顺序，使加工的时间跨度（从开始加工到全部工件都加工完所需要的时间）达到最小。其中，（1）表示工件约束条件：对每个工件而言，机器对它的加工路线是事先确定的；（2）表示机器约束条件：对每台机器而言，一次只能对一道工序进行加工。
任给一个输入实例，能输出最短时间以及每台机器上工序的加工顺序。
能设计出一个用户界面。
-m Taiwan different machines, n different workpiece. Each have a process workpiece, and each procedure specified by the machine in a fixed time. A process once started, it can not be interrupted. Each machine can only handle one time processes. Scheduling is a decision each machine processes the order processing, machinery parts to complete all the shortest time. Specifically, the problem is meeting the requirements (1), (2) 2 restrictive conditions on the premise that each machine to determine the order of the manufacturing process, so that the processing time span (from the beginning of the processing of all jobs have been finished.Chen the time required) to a minimum. Among them, (1) workpiece restrictive conditions : for each workpiece, the machine's processing line it is determined Platform: |
Size: 4622 |
Author:chen |
Hits:
Description: 最佳高度问题。
问题描述：
假设有n个任务由K个可并行工作的机器完成。完成任务i需要的时间为t(i)。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-best height of the problem. Problem description : Suppose a mandate from the n-K parallel work can be completed machines. I need to complete the task for the time t (i). Try to find an algorithm designed to complete tasks n the best scheduling, made to complete all tasks in the first. Platform: |
Size: 1342 |
Author:卢起雪 |
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: 40966 |
Author:阳林 |
Hits:
Description: 完成流水线安排问题的解决，具体问题描述如下：
有m台不同的机器，n个不同的工件。每个工件有多道工序，每道工序由指定的机器在固定的时间内完成。一道工序一旦开始处理，就不能中断。每台机器一次只能处理一道工序。一个调度就是决定每台机器上工序的处理顺序，使得机器完成所有工件的时间最短。具体的，该问题就是要求在满足（1）、（2）两个约束条件的前提下，确定每台机器上工序的顺序，使加工的时间跨度（从开始加工到全部工件都加工完所需要的时间）达到最小。其中，（1）表示工件约束条件：对每个工件而言，机器对它的加工路线是事先确定的；（2）表示机器约束条件：对每台机器而言，一次只能对一道工序进行加工。
解决方案用图形界面画出。-pipeline completed arrangements for the settlement of this problem, the specific issues described as follows : m Taiwan different machines, n different workpiece. Each have a process workpiece, and each procedure specified by the machine at a fixed time. Once a process started, it can not be interrupted. Each machine can handle only one a process. Scheduling is a decision each machine processes the order processing, machinery parts to complete all the shortest time. Specific, the issue is meeting the requirements of (1), (2) 2 binding conditions on the premise that identify each machine processes the order, so that the processing time span (from the beginning of the processing of all parts are needed to complete the processing time) to achieve the smallest. Which, (a) the workpiece constra Platform: |
Size: 414138 |
Author:荣平 |
Hits:
Description: 一个简单的虚拟机和虚拟操作系统，支持进程调度、文件系统，包含简单的汇编支持，偶去年的作业。-a simple virtual machines and virtual operating system, support for the process scheduling, file system, the compilation contains simple, even last year's operations. Platform: |
Size: 94508 |
Author:丁雷 |
Hits:
Description: 操作系统概论，应用原理与编程技巧及其应用。本人见解肤浅，近请原谅。...机分配给进程以及协调各个进程之间的相互关系。它由进程调度程序和.. .进程调度是低级调度,作业调度是高级调度。 14进程调度算法有:先来先服务 轮转调度分级轮转法和优先数法。其中分级轮转法较为理想。-OS Studies, Theory and Application Programming Techniques and Applications. I superficial insights, please forgive the past. ... Machines allocated to the process and the coordination between the various processes mutual relations. It is the process of scheduling procedures and ... Process scheduling is vulgar scheduling, scheduling senior scheduling. Process Scheduling Algorithm 14 : first-come first-serve Web postings of France scheduling classification and priority numbers. Classification Act which rotate better. Platform: |
Size: 219770 |
Author:语言 |
Hits:
Description: 一个简单的虚拟机和虚拟操作系统，支持进程调度、文件系统，包含简单的汇编支持，偶去年的作业。-a simple virtual machines and virtual operating system, support for the process scheduling, file system, the compilation contains simple, even last year's operations. Platform: |
Size: 139264 |
Author:丁雷 |
Hits:
Description: 操作系统概论，应用原理与编程技巧及其应用。本人见解肤浅，近请原谅。...机分配给进程以及协调各个进程之间的相互关系。它由进程调度程序和.. .进程调度是低级调度,作业调度是高级调度。 14进程调度算法有:先来先服务 轮转调度分级轮转法和优先数法。其中分级轮转法较为理想。-OS Studies, Theory and Application Programming Techniques and Applications. I superficial insights, please forgive the past. ... Machines allocated to the process and the coordination between the various processes mutual relations. It is the process of scheduling procedures and ... Process scheduling is vulgar scheduling, scheduling senior scheduling. Process Scheduling Algorithm 14 : first-come first-serve Web postings of France scheduling classification and priority numbers. Classification Act which rotate better. Platform: |
Size: 219136 |
Author:语言 |
Hits:
Description: 有m台不同的机器，n个不同的工件。每个工件有多道工序，每道工序由指定的机器在固定的时间内完成。一道工序一旦开始处理，就不能中断。每台机器一次只能处理一道工序。一个调度就是决定每台机器上工序的处理顺序，使得机器完成所有工件的时间最短。具体的，该问题就是要求在满足（1）、（2）两个约束条件的前提下，确定每台机器上工序的顺序，使加工的时间跨度（从开始加工到全部工件都加工完所需要的时间）达到最小。其中，（1）表示工件约束条件：对每个工件而言，机器对它的加工路线是事先确定的；（2）表示机器约束条件：对每台机器而言，一次只能对一道工序进行加工。
任给一个输入实例，能输出最短时间以及每台机器上工序的加工顺序。
能设计出一个用户界面。
-m Taiwan different machines, n different workpiece. Each have a process workpiece, and each procedure specified by the machine in a fixed time. A process once started, it can not be interrupted. Each machine can only handle one time processes. Scheduling is a decision each machine processes the order processing, machinery parts to complete all the shortest time. Specifically, the problem is meeting the requirements (1), (2) 2 restrictive conditions on the premise that each machine to determine the order of the manufacturing process, so that the processing time span (from the beginning of the processing of all jobs have been finished.Chen the time required) to a minimum. Among them, (1) workpiece restrictive conditions : for each workpiece, the machine's processing line it is determined Platform: |
Size: 4096 |
Author:chen |
Hits:
Description: 最佳高度问题。
问题描述：
假设有n个任务由K个可并行工作的机器完成。完成任务i需要的时间为t(i)。试设计一个算法找出完成这n个任务的最佳调度，使得完成全部任务的时间最早。-best height of the problem. Problem description : Suppose a mandate from the n-K parallel work can be completed machines. I need to complete the task for the time t (i). Try to find an algorithm designed to complete tasks n the best scheduling, made to complete all tasks in the first. Platform: |
Size: 1024 |
Author:卢起雪 |
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: 完成流水线安排问题的解决，具体问题描述如下：
有m台不同的机器，n个不同的工件。每个工件有多道工序，每道工序由指定的机器在固定的时间内完成。一道工序一旦开始处理，就不能中断。每台机器一次只能处理一道工序。一个调度就是决定每台机器上工序的处理顺序，使得机器完成所有工件的时间最短。具体的，该问题就是要求在满足（1）、（2）两个约束条件的前提下，确定每台机器上工序的顺序，使加工的时间跨度（从开始加工到全部工件都加工完所需要的时间）达到最小。其中，（1）表示工件约束条件：对每个工件而言，机器对它的加工路线是事先确定的；（2）表示机器约束条件：对每台机器而言，一次只能对一道工序进行加工。
解决方案用图形界面画出。-pipeline completed arrangements for the settlement of this problem, the specific issues described as follows : m Taiwan different machines, n different workpiece. Each have a process workpiece, and each procedure specified by the machine at a fixed time. Once a process started, it can not be interrupted. Each machine can handle only one a process. Scheduling is a decision each machine processes the order processing, machinery parts to complete all the shortest time. Specific, the issue is meeting the requirements of (1), (2) 2 binding conditions on the premise that identify each machine processes the order, so that the processing time span (from the beginning of the processing of all parts are needed to complete the processing time) to achieve the smallest. Which, (a) the workpiece constra Platform: |
Size: 413696 |
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: 177152 |
Author:me |
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: MATLAB6.5辅助优化计算与设计,遗传算法在车间布局优化中的应用-We address the two-stage assembly scheduling problem where there are m machines at the first stage and an assembly machine at the second stage. Platform: |
Size: 7168 |
Author:小李子 |
Hits:
Description: 实现网格中含有依赖任务调度的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 Platform: |
Size: 4096 |
Author:吴明 |
Hits:
Description: c program for identifying bottleneck machines in a job shop (used in the scheduling of the shop floor)
Platform: |
Size: 8192 |
Author:bharath |
Hits:
Description: n个任务在流水线上进行m个阶段的加工
，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机
器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以
在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所
有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最
小。-n-m on the task in the pipeline processing stages, each stage has at least one machine there and at least one stage of multiple machines and each machine on the same stage of the processing performance of the same, at each stage required to complete each task a process, the task of each process in the corresponding stage of any one of the machine processing, known task processing time for each process, identify all tasks required for each stage of the sorting and distribution of the machine, making the scheduling Index (General requirements Makespan) minimum. Platform: |
Size: 3072 |
Author:guoxiangwang |
Hits:
Description: 将对n个独立作业如何分配在m台相同的机器加工处理的多机调度问题进行解决，这就是我们要解决的任务。
本程序编写目的为使得解决多机调度问题的过程以图形界面方式动态的展示出来，以让用户能够轻易的看出解决的方案以及过程。采用java开发。
-Will be n independent jobs on m machines how to allocate the same machine processing of multi-machine scheduling problem to solve, this is what we want to solve the task. The programming for the purpose of making multi-machine scheduling problem solving process in graphical interface dynamically displayed, so that the user can easily see the solution to the problem as well as process. Using java development. Platform: |
Size: 360448 |
Author:invest |
Hits:
Search - scheduling Machines