Scheduling jobs with communication delays: Using infeasible solutions for approximation
From MaRDI portal
Publication:4595479
DOI10.1007/3-540-61680-2_48zbMath1379.68028OpenAlexW1517653283MaRDI QIDQ4595479
Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_48
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (5)
Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays ⋮ Bicriteria approximation algorithms for scheduling problems with communications delays ⋮ Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds ⋮ Server cloud scheduling ⋮ Server cloud scheduling
This page was built for publication: Scheduling jobs with communication delays: Using infeasible solutions for approximation
