Approximation schemes for two-agent scheduling on parallel machines

DOI10.1016/J.TCS.2012.11.002zbMath1259.68085OpenAlexW1995795314MaRDI QIDQ1935796

Kejun Zhao, Xi-wen Lu

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.002

zbMATH Keywords

algorithmdynamic programmingparallel machinesagent schedulingfully polynomial time approximation scheme

Mathematics Subject Classification ID

Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42)

Related Items (13)

Two-agent parallel-machine scheduling with rejection ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ A Review for Submodular Optimization on Machine Scheduling Problems ⋮ Competitive multi-agent scheduling with an iterative selection rule ⋮ Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes ⋮ Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks ⋮ Two-agent scheduling on a single machine with release dates ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ Vehicle scheduling problems with two agents on a line ⋮ Two agent scheduling with a central selection mechanism

This page was built for publication: Approximation schemes for two-agent scheduling on parallel machines