Approximating the discrete resource sharing scheduling problem (2011)
Source: International Journal of Foundations of Computer Science. Conference titles: Workshop on Advances in Parallel and Distributed Computational Models - APDCM. Unidade: IME
Assunto: ALGORITMOS
ABNT
BOUGERET, Marin et al. Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science. Singapore: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1142/S0129054111008271. Acesso em: 10 set. 2024. , 2011APA
Bougeret, M., Dutot, P. -F., Goldman, A., Ngoko, Y., & Trystram, D. (2011). Approximating the discrete resource sharing scheduling problem. International Journal of Foundations of Computer Science. Singapore: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1142/S0129054111008271NLM
Bougeret M, Dutot P-F, Goldman A, Ngoko Y, Trystram D. Approximating the discrete resource sharing scheduling problem [Internet]. International Journal of Foundations of Computer Science. 2011 ; 22( 3): 639-656.[citado 2024 set. 10 ] Available from: https://doi.org/10.1142/S0129054111008271Vancouver
Bougeret M, Dutot P-F, Goldman A, Ngoko Y, Trystram D. Approximating the discrete resource sharing scheduling problem [Internet]. International Journal of Foundations of Computer Science. 2011 ; 22( 3): 639-656.[citado 2024 set. 10 ] Available from: https://doi.org/10.1142/S0129054111008271