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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 1012; s. 114729
Hlavní autoři: Gu, Manzhan, Liu, Peihai, Lu, Xiwen
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 12.10.2024
Témata:
Job preemption
Makespan minimization
Total completion time minimization
Two-agent scheduling
Uniform machines
Uniform machines
Makespan minimization
Total completion time minimization
Two-agent scheduling
Job preemption
ISSN:0304-3975
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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