An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines

DOI10.1007/s10951-017-0546-9zbMath1420.90020OpenAlexW2766970262MaRDI QIDQ2317128

Jinwei Gu, Manzhan Gu, Xi-wen Lu

Publication date: 8 August 2019

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-017-0546-9

zbMATH Keywords

schedulingmakespanLPTmulti-agent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent, The LPT heuristic for minimizing total load on a proportionate openshop, Two-agent scheduling on a single machine with release dates

Cites Work

• A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
• Analyzing scheduling with transient failures
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• A Lagrangian approach to single-machine scheduling problems with two competing agents
• Unbounded parallel-batching scheduling with two competitive agents
• Bounded parallel-batching scheduling with two competing agents
• Multi-agent scheduling on a single machine with max-form criteria
• Multi-agent single machine scheduling
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Competitive Two-Agent Scheduling and Its Applications
• Scheduling Problems with Two Competing Agents
• Multiagent Scheduling