Search - scheduling n m

Search - scheduling n m - List

[Other] lsxarrange DL : 0: 完成流水线安排问题的解决，具体问题描述如下：有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
Date : 2025-12-19 Size : 404kb User : 荣平
[Other] chejiandiaodu DL : 0: 流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小。下面的源码是求解流水线型车间作业调度问题的遗传算法通用MATLAB源码，属于GreenSim团队原创作品，博客上发布的是不完全的源码，本人将其补充完成已成功运行，转载请注明GreenSim团队原创作品。-Pipelined job-shop scheduling problem can be described as follows: n tasks on the assembly line m processing stages, each stage has at least one machine and at least one stage there are multiple machines, and the same processing performance of each machine on the same stage , at every stage to complete each task are a process, each process of each task can be processed on any machine on the corresponding stage of the processing time of each process known tasks, all tasks required to determine the sort and every Distribution of the machine on a stage, making scheduling index (typically seek Makespan) Min. The following code is a Genetic Algorithm for Job Shop Scheduling Problem pipelined general MATLAB source code, original works belong GreenSim team, the blog post is incomplete source code, I will supplement has been successfully completed its operation, please indicate the original team GreenSim works.
Date : 2025-12-19 Size : 3kb User : yyl
[Other] 02MATLAB DL : 0: 流水线车间生产调度的遗传算法MATLAB源代码 n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工，已知任务各道工序的处理时间，要求确定所有任务的排序以及每一阶段上机器的分配情况，使得调度指标(一般求Makespan)最小-Line workshop production scheduling genetic algorithm MATLAB source code n task m phase of the process on the assembly line, each phase and at least one machine exist multiple machines at least one stage, and all the same, the processing performance of the machine on the same phase in each stage of the task to complete the procedure, the task of every working procedure can be found in the corresponding stage of any one machine processing, known task processing time of each working procedure request sort of all the tasks and each stage of the distribution of the machine, making scheduling index minimum Makespan (o)
Date : 2025-12-19 Size : 19kb User : 樊奕