Koutecký, M., & Zink, J. (2025). Complexity of scheduling few types of jobs on related and unrelated machines. Journal of Scheduling, 28(1), 139-156. https://doi.org/10.1007/s10951-024-00827-8
Chicago-referens (17:e uppl.)Koutecký, Martin, och Johannes Zink. "Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines." Journal of Scheduling 28, no. 1 (2025): 139-156. https://doi.org/10.1007/s10951-024-00827-8.
MLA-referens (9:e uppl.)Koutecký, Martin, och Johannes Zink. "Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines." Journal of Scheduling, vol. 28, no. 1, 2025, pp. 139-156, https://doi.org/10.1007/s10951-024-00827-8.
Varning: dessa hänvisningar är inte alltid fullständigt riktiga.
