Search - scheduling n m

Search - scheduling n m - List

[Other resource] 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 : 2008-10-13 Size : 4.51kb User : chen
[Other resource] MYMM1 DL : 3: M/M/1单服务台排队系统仿真（用事件调度法实现离散事件系统仿真）顾客到达模到达时间间隔和顾客服务时间均服从负指数分布，单服务台系统，按照单队排队，按FIFO方式服务。考察服务n个顾客（n=1000，2000，3000，5000）后的顾客平均队长及平均排队等待时间。-M/M/1 single-server queuing system simulation (using Event Scheduling Method Discrete Event Simulation System) to customers Da-mo arrival time interval and customer service time are negative exponential distribution, single-desk system, in accordance with the single-team queue, by FIFO mode services. N inspection services customers (n = 1000,2000,3000. 5000) the average customer captain, and the average queue time.
Date : 2008-10-13 Size : 1.46kb User : 麦麦