Task scheduling in networks

DOI10.1007/3-540-58218-5_27zbMath1502.68370OpenAlexW1705148050MaRDI QIDQ5054769

Cynthia A. Phillips, Clifford Stein, Joel M. Wein

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_27

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Scheduling jobs that arrive over time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Bounds for naive multiple machine scheduling with release times and deadlines
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• A Greedy Heuristic for the Set-Covering Problem
• Scheduling independent tasks to reduce mean finishing time
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Technical Note—Minimizing Average Flow Time with Parallel Machines

This page was built for publication: Task scheduling in networks