Approximation algorithms for average stretch scheduling
From MaRDI portal
Publication:2464419
DOI10.1023/B:JOSH.0000019681.52701.8bzbMath1154.90414MaRDI QIDQ2464419
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:josh.0000019681.52701.8b
90B35: Deterministic scheduling theory in operations research
Related Items
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time, Unnamed Item, Minimizing the stretch when scheduling flows of divisible requests, From Preemptive to Non-preemptive Scheduling Using Rejections