Source: Computers & Operations Research,. Unidade: EP
Subjects: PROGRAMAÇÃO DA PRODUÇÃO, SEQUENCIAÇÃO DA PRODUÇÃO, SCHEDULING, HEURÍSTICA
ABNT
SAKURABA, Celso Satoshi e RONCONI, Débora Pretti e SOURD, Francis. Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. Computers & Operations Research, v. 36, n. 1, p. 60-72, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2007.07.005. Acesso em: 10 ago. 2024.APA
Sakuraba, C. S., Ronconi, D. P., & Sourd, F. (2009). Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. Computers & Operations Research,, 36( 1), 60-72. doi:10.1016/j.cor.2007.07.005NLM
Sakuraba CS, Ronconi DP, Sourd F. Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. [Internet]. Computers & Operations Research,. 2009 ; 36( 1): 60-72.[citado 2024 ago. 10 ] Available from: https://doi.org/10.1016/j.cor.2007.07.005Vancouver
Sakuraba CS, Ronconi DP, Sourd F. Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. [Internet]. Computers & Operations Research,. 2009 ; 36( 1): 60-72.[citado 2024 ago. 10 ] Available from: https://doi.org/10.1016/j.cor.2007.07.005