TAO, Liangde, CHEN, Lin und ZHANG, Guochuan, 2021. Scheduling Stochastic Jobs - Complexity and Approximation Algorithms. Proceedings of the International Conference on Automated Planning and Scheduling; Vol. 31 (2021): Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling; 367-375. 1 Januar 2021. DOI 10.1609 caps.v31 i1.15982.
Elsevier - Harvard (with titles)Tao, L., Chen, L., Zhang, G., 2021. Scheduling Stochastic Jobs - Complexity and Approximation Algorithms. Proceedings of the International Conference on Automated Planning and Scheduling; Vol. 31 (2021): Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling; 367-375. https://doi.org/10.1609 caps.v31 i1.15982
American Psychological Association 7th editionTao, L., Chen, L., & Zhang, G. (2021). Scheduling Stochastic Jobs - Complexity and Approximation Algorithms. Proceedings of the International Conference on Automated Planning and Scheduling; Vol. 31 (2021): Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling; 367-375. https://doi.org/10.1609 caps.v31 i1.15982
Springer - Basic (author-date)Tao L, Chen L, Zhang G (2021) Scheduling Stochastic Jobs - Complexity and Approximation Algorithms. Proceedings of the International Conference on Automated Planning and Scheduling; Vol. 31 (2021): Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling; 367-375. https://doi.org/10.1609 caps.v31 i1.15982
Juristische Zitierweise (Stüber) (Deutsch)Tao, Liangde/ Chen, Lin/ Zhang, Guochuan, Scheduling Stochastic Jobs - Complexity and Approximation Algorithms, Proceedings of the International Conference on Automated Planning and Scheduling; Vol. 31 (2021): Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling; 367-375 2021.