南阳师范学院学报2024，Vol.23Issue(5)：49-54,6.
工件具有权重和服务等级约束的平行批在线排序算法
Parallel-batch online scheduling algorithm for workpieces with weight and service level constraints
摘要
Abstract
This paper is about the problem of parallel-batch online scheduling on two machines with a grade of service constrains and weight.According to the characteristics of the workpieces and machine,there are corre-sponding level constraints.A workpiece can be processed by a machine if and only if its grade is not higher than that of the machine.Workpieces are released over time,with weight and same processing time.Machines can process jobs in parallel batches,and multiple jobs can be processed simultaneously in a batch using a single ma-chine,without exceeding the batch capacity.The objective is to minimize the maximum weighted completion.The lower bound of the competition ratio of online algorithms is discussed,and the best possible online algorithm is designed to match the lower bound√5+12.关键词
排序/时间在线/服务等级/权重/平行批Key words
scheduling/time online/service level/weight/parallel batch分类
数理科学引用本文复制引用
王新鹏,柴幸..工件具有权重和服务等级约束的平行批在线排序算法[J].南阳师范学院学报,2024,23(5):49-54,6.基金项目
国家自然科学基金项目(12001169) （12001169）
