Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines

This paper studies two scheduling problems involving two agents A and B, where each agent has an independent set of jobs and all jobs are to be processed preemptively on uniform parallel machines. The aims of the two problems are to minimize the objective function value of agent A with the makespan...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2024-10, Vol.1012, p.114729, Article 114729
Main Authors: Gu, Manzhan, Liu, Peihai, Lu, Xiwen
Format: Article
Language:English
Subjects:
Job preemption
Makespan minimization
Total completion time minimization
Two-agent scheduling
Uniform machines
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies two scheduling problems involving two agents A and B, where each agent has an independent set of jobs and all jobs are to be processed preemptively on uniform parallel machines. The aims of the two problems are to minimize the objective function value of agent A with the makespan of agent B not exceeding a threshold T. In the first problem, there are m machines and the objective function of agent A is the makespan. In the second problem, there are two machines and the objective function of agent A is the total completion time. For each of the two problems, we propose an optimal algorithm and obtain some extended results.
ISSN:0304-3975
DOI:10.1016/j.tcs.2024.114729