Scheduling in switching networks with set-up delays

DOI10.1007/s10878-005-5483-4zbMath1067.90012OpenAlexW1974950526MaRDI QIDQ1774526

Timos Aslanidis, Evripidis Bampis, Ioannis Milis, Foto N. Afrati

Publication date: 17 May 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-5483-4

zbMATH Keywords

schedulingswitching networksapproximation algorithmsset-up delays

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items

On the max-weight edge coloring problem ⋮ Approximating the max-edge-coloring problem ⋮ On the Maximum Edge Coloring Problem

Cites Work

• On the Complexity of Timetable and Multicommodity Flow Problems
• On approximating a scheduling problem