Jansen, K., & Porkolab, L. (2002). Polynomial time approximation schemes for general multiprocessor job shop scheduling. Journal of algorithms, 45(2), 167-191. https://doi.org/10.1016/S0196-6774(02)00248-1
Citace podle Chicago (17th ed.)Jansen, Klaus, a Lorant Porkolab. "Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling." Journal of Algorithms 45, no. 2 (2002): 167-191. https://doi.org/10.1016/S0196-6774(02)00248-1.
Citace podle MLA (9th ed.)Jansen, Klaus, a Lorant Porkolab. "Polynomial Time Approximation Schemes for General Multiprocessor Job Shop Scheduling." Journal of Algorithms, vol. 45, no. 2, 2002, pp. 167-191, https://doi.org/10.1016/S0196-6774(02)00248-1.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..