ReP USP - Resultado da busca

Artigo de periodico
Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times (2023)
Souza, Edson Antonio Gonçalves de; Nagano, Marcelo Seido ; Miyata, Hugo Hissashi; Abreu, Levi Ribeiro de
Source: Journal of Project Management. Unidade: EESC
Subjects: PROGRAMAÇÃO DA PRODUÇÃO, PROGRAMAÇÃO DINÂMICA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SOUZA, Edson Antonio Gonçalves de et al. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times. Journal of Project Management, v. 8, n. 2, p. 99-118, 2023Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2022.12.001. Acesso em: 26 set. 2024.
APA
Souza, E. A. G. de, Nagano, M. S., Miyata, H. H., & Abreu, L. R. de. (2023). Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times. Journal of Project Management, 8( 2), 99-118. doi:10.5267/j.jpm.2022.12.001
NLM
Souza EAG de, Nagano MS, Miyata HH, Abreu LR de. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times [Internet]. Journal of Project Management. 2023 ; 8( 2): 99-118.[citado 2024 set. 26 ] Available from: https://dx.doi.org/10.5267/j.jpm.2022.12.001
Vancouver
Souza EAG de, Nagano MS, Miyata HH, Abreu LR de. Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times [Internet]. Journal of Project Management. 2023 ; 8( 2): 99-118.[citado 2024 set. 26 ] Available from: https://dx.doi.org/10.5267/j.jpm.2022.12.001
Artigo de periodico
Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function (2022)
Miyata, Hugo Hissashi ; Nagano, Marcelo Seido ; Gupta, Jatinder N. D
Source: International Journal of Production Research. Unidade: EESC
Subjects: SEQUENCIAÇÃO DA PRODUÇÃO, SCHEDULING, PROGRAMAÇÃO LINEAR, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYATA, Hugo Hissashi e NAGANO, Marcelo Seido e GUPTA, Jatinder N. D. Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function. International Journal of Production Research, p. 1-29, 2022Tradução . . Disponível em: https://doi.org/10.1080/00207543.2022.2127959. Acesso em: 26 set. 2024.
APA
Miyata, H. H., Nagano, M. S., & Gupta, J. N. D. (2022). Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function. International Journal of Production Research, 1-29. doi:10.1080/00207543.2022.2127959
NLM
Miyata HH, Nagano MS, Gupta JND. Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function [Internet]. International Journal of Production Research. 2022 ; 1-29.[citado 2024 set. 26 ] Available from: https://doi.org/10.1080/00207543.2022.2127959
Vancouver
Miyata HH, Nagano MS, Gupta JND. Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function [Internet]. International Journal of Production Research. 2022 ; 1-29.[citado 2024 set. 26 ] Available from: https://doi.org/10.1080/00207543.2022.2127959
Artigo de periodico
An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan (2022)
Miyata, Hugo Hissashi; Nagano, Marcelo Seido
Source: Computers & Industrial Engineering. Unidade: EESC
Subjects: SEQUENCIAÇÃO DA PRODUÇÃO, SCHEDULING, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYATA, Hugo Hissashi e NAGANO, Marcelo Seido. An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan. Computers & Industrial Engineering, v. 171, p. 1-25, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2022.108366. Acesso em: 26 set. 2024.
APA
Miyata, H. H., & Nagano, M. S. (2022). An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan. Computers & Industrial Engineering, 171, 1-25. doi:10.1016/j.cie.2022.108366
NLM
Miyata HH, Nagano MS. An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan [Internet]. Computers & Industrial Engineering. 2022 ; 171 1-25.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.cie.2022.108366
Vancouver
Miyata HH, Nagano MS. An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan [Internet]. Computers & Industrial Engineering. 2022 ; 171 1-25.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.cie.2022.108366
Artigo de periodico
Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm (2021)
Miyata, Hugo Hissashi; Nagano, Marcelo Seido
Source: Journal of Manufacturing Systems. Unidade: EESC
Subjects: PROGRAMAÇÃO DA PRODUÇÃO, QUALIDADE DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYATA, Hugo Hissashi e NAGANO, Marcelo Seido. Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm. Journal of Manufacturing Systems, v. 61, p. 592-612, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.jmsy.2021.10.005. Acesso em: 26 set. 2024.
APA
Miyata, H. H., & Nagano, M. S. (2021). Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm. Journal of Manufacturing Systems, 61, 592-612. doi:10.1016/j.jmsy.2021.10.005
NLM
Miyata HH, Nagano MS. Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm [Internet]. Journal of Manufacturing Systems. 2021 ; 61 592-612.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.jmsy.2021.10.005
Vancouver
Miyata HH, Nagano MS. Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm [Internet]. Journal of Manufacturing Systems. 2021 ; 61 592-612.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.jmsy.2021.10.005
Artigo de periodico
An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (2020)
Nagano, Marcelo Seido ; Almeida, Fernando Siqueira de; Miyata, Hugo Hissashi
Source: Engineering Optimization. Unidade: EESC
Subjects: ALGORITMOS, PROGRAMAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NAGANO, Marcelo Seido e ALMEIDA, Fernando Siqueira de e MIYATA, Hugo Hissashi. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, p. [1-20], 2020Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2020.1797000. Acesso em: 26 set. 2024.
APA
Nagano, M. S., Almeida, F. S. de, & Miyata, H. H. (2020). An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, [1-20]. doi:10.1080/0305215X.2020.1797000
NLM
Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2024 set. 26 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000
Vancouver
Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2024 set. 26 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000

USP Schools

ReP

Filtros

Authors

Subjects

Funding Agencies

Indexado em