Search - scheduling n m

Search - scheduling n m - List

[AI-NN-PR] he-pipeline-processing-stages DL : 0: 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.
Date : 2025-12-19 Size : 3kb User : guoxiangwang
[AI-NN-PR] encode-and-decode-of-shop-job DL : 0: 用于车间调度的编码和解码。 encode函数用于生成M*N的编码数组。M为机器数，N为工件数。 Jm数组的行，表示对应工件在不同机器上的加工顺序。数组内容为机器号。 T数组为加工时间数组。第M行第N列，表示第N号工件在第M号机器上的加工时间。程序采用先判断对应机器上是否有空间满足插空标准，处理后，再判断是否产生新的空间。 decode解码函数最终需要求得，在M个机器中，所用的最长时间，也就是最大完成时间，作为解码的结果。-For shop scheduling encoding and decoding. The encode function used to generate the array of M* N coding. M is the number of machines, N is the number of workpieces. Jm row of the array, which means that the corresponding workpiece machining sequences on different machines. The contents of the array is the number of the machine. T array is an array of processing time. The first N columns of the M-th row, which means that the processing time of the workpiece in the machine M N. The program uses to determine whether there is space to meet the inserted empty standard corresponding to the machine, processing, and then to determine whether a new space. decode decoding function will eventually need to be obtained, M machine, the best time, which is the maximum completion time, as a result of the decoding.
Date : 2025-12-19 Size : 2kb User : 郑世杰
[AI-NN-PR] GA_Flow-Shop DL : 1: 流水线型车间作业调度问题可以描述如下：n个任务在流水线上进行m个阶段的加工，每一阶段至少有一台机器且至少有一个阶段存在多台机器，并且同一阶段上各机器的处理性能相同，在每一阶段各任务均要完成一道工序，各任务的每道工序可以在相应阶段上的任意一台机器上加工-Pipelined job shop scheduling problem can be described as follows: n tasks for the m-th stage processing on the assembly line, there is at each stage of the at least one machine with at least the presence of many machines a stage, and the same processing performance of each machine on the same stage , at each stage any machine each task required to complete a process, each process of each task can be processed in the respective stages
Date : 2025-12-19 Size : 3kb User : chaoshuai