Kacem, I., & Kellerer, H. (2011). Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. Journal of scheduling, 14(3), 257-265. https://doi.org/10.1007/s10951-009-0146-4
Citácia podle Chicago (17th ed.)Kacem, Imed, a Hans Kellerer. "Fast Approximation Algorithms to Minimize a Special Weighted Flow-time Criterion on a Single Machine with a Non-availability Interval and Release Dates." Journal of Scheduling 14, no. 3 (2011): 257-265. https://doi.org/10.1007/s10951-009-0146-4.
Citácia podľa MLA (8th ed.)Kacem, Imed, a Hans Kellerer. "Fast Approximation Algorithms to Minimize a Special Weighted Flow-time Criterion on a Single Machine with a Non-availability Interval and Release Dates." Journal of Scheduling, vol. 14, no. 3, 2011, pp. 257-265, https://doi.org/10.1007/s10951-009-0146-4.