一类加工需要额外资源的平行机调度问题的算法设计OA北大核心CSTPCD

An exact algorithm is presented for a parallel machine scheduling problem with additional resources constraints.Specifically,the jobs need be processed on parallel machines,and the processing of each job requires a unit of some additional resources in addition to machine resource.The variety and amount of additional resources are limited,our goal is to make the optimal schedule of the problem so that the completion time of the final completed job is minimized.This problem originates from the field of earth observation satellite data download,and has been widely used in intelligent manufacturing and information processing.The integer programming model,the lower bound of the optimal solution and the branch and bound algorithm of the problem are given.An effective branching strategy is proposed to avoid repeated branching and a bound method is designed to improve the convergence rate of the algorithm.The correctness and the effectiveness of the algorithm under different parameter configuration are verified by a large number of numerical simulation experiments and a small-sized instance example.