文献类型：期刊文献

英文题名：Optimal preemptive scheduling of two competing agents on uniform machines

作者：Gu, Manzhan[1];Liu, Peihai[2]

机构：[1]Shanghai Univ Finance & Econ, Sch Math, Shanghai 200433, Peoples R China;[2]East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China

年份：2026

卷号：67

外文期刊名：OPERATIONS RESEARCH LETTERS

收录：;EI(收录号：20261820617797);WOS:【SCI-EXPANDED(收录号:WOS:001759901600001)】；

基金：This work is supported by the National Natural Science Foundation China (12571338, 12371317) .

语种：英文

外文关键词：Scheduling; Two-agent; Uniform machines; Total completion time; Makespan

摘要：This paper addresses a scheduling problem involving two agents, namely A and B. Each agent has a distinct set of jobs, and all these jobs are to be scheduled on m uniform machines with preemption allowed. The objective is to minimize the total completion time of agent A's jobs, while ensuring that the makespan of agent B's jobs does not exceed a given threshold. For the problem, we present a polynomial-time algorithm that can achieve an optimal solution.