Search - scheduling n m

Search - scheduling n m - List

[Data structs] chejiandiaodu DL : 0: 有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
Date : 2025-12-19 Size : 4kb User : chen
[Data structs] 2 DL : 0: 飞机调度这用链表处理的飞机调度问题，飞机场有n架飞机m条跑道，飞机起飞一次用时k。给出飞机来时的时间安排跑道。-Aircraft scheduling
Date : 2025-12-19 Size : 16kb User : 张开
[Data structs] Multi-machine-scheduling DL : 0: 将对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.
Date : 2025-12-19 Size : 352kb User : invest
[Data structs] Job DL : 0: 要求给出一种作业调度方案，使所给的n个作业在尽可能短的时间内由m台机器加工处理完成。约定，每个作业均可在任何一台机器上加工处理，但未完工前不允许中断处理。作业不能拆分成更小的子作业。-Required to give a scheduling program, so as to the n operations in the shortest possible time by the m-machine processing. Convention, each job can be processed on any machine, but not completed before the interrupt handler is not allowed. Jobs can not be split into smaller sub-jobs.
Date : 2025-12-19 Size : 1kb User : 刘远忠