ReP USP - Resultado da busca

Artigo de periodico
Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion (2022)
Rossi, Fernando Luis; Nagano, Marcelo Seido
Source: OR Spectrum. Unidade: EESC
Subjects: HEURÍSTICA, MANUFATURA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROSSI, Fernando Luis e NAGANO, Marcelo Seido. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion. OR Spectrum, p. 1-36, 2022Tradução . . Disponível em: https://doi.org/10.1007/s00291-022-00678-9. Acesso em: 24 jul. 2024.
APA
Rossi, F. L., & Nagano, M. S. (2022). Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion. OR Spectrum, 1-36. doi:10.1007/s00291-022-00678-9
NLM
Rossi FL, Nagano MS. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion [Internet]. OR Spectrum. 2022 ; 1-36.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/s00291-022-00678-9
Vancouver
Rossi FL, Nagano MS. Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion [Internet]. OR Spectrum. 2022 ; 1-36.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/s00291-022-00678-9
Artigo de periodico
Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows (2021)
Rolim, Gustavo Alencar; Nagano, Marcelo Seido ; Prata, Bruno de Athayde
Source: Arabian Journal for Science and Engineering. Unidade: EESC
Subjects: HEURÍSTICA, 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
ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido e PRATA, Bruno de Athayde. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows. Arabian Journal for Science and Engineering, p. 1-15, 2021Tradução . . Disponível em: https://doi.org/10.1007/s13369-021-06244-9. Acesso em: 24 jul. 2024.
APA
Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2021). Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows. Arabian Journal for Science and Engineering, 1-15. doi:10.1007/s13369-021-06244-9
NLM
Rolim GA, Nagano MS, Prata B de A. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows [Internet]. Arabian Journal for Science and Engineering. 2021 ; 1-15.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/s13369-021-06244-9
Vancouver
Rolim GA, Nagano MS, Prata B de A. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows [Internet]. Arabian Journal for Science and Engineering. 2021 ; 1-15.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/s13369-021-06244-9
Artigo de periodico
A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop (2017)
Nagano, Marcelo Seido ; Rossi, Fernando Luis; Tomazella, Caio Paziani
Source: Production Engineering: research and development. Unidade: EESC
Subjects: SCHEDULING, HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NAGANO, Marcelo Seido e ROSSI, Fernando Luis e TOMAZELLA, Caio Paziani. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop. Production Engineering: research and development, n. 11, p. 523-529, 2017Tradução . . Disponível em: https://doi.org/10.1007/s11740-017-0747-2. Acesso em: 24 jul. 2024.
APA
Nagano, M. S., Rossi, F. L., & Tomazella, C. P. (2017). A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop. Production Engineering: research and development, ( 11), 523-529. doi:10.1007/s11740-017-0747-2
NLM
Nagano MS, Rossi FL, Tomazella CP. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop [Internet]. Production Engineering: research and development. 2017 ;( 11): 523-529.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/s11740-017-0747-2
Vancouver
Nagano MS, Rossi FL, Tomazella CP. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop [Internet]. Production Engineering: research and development. 2017 ;( 11): 523-529.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/s11740-017-0747-2
Artigo de periodico
New heuristics for the no-wait flowshop with sequence-dependent setup times problem (2014)
Nagano, Marcelo Seido; Araújo, Daniella Castro
Source: Journal of Brazilian Society of Mechanical Sciences and Engineering. Unidade: EESC
Subjects: HEURÍSTICA, ALGORITMOS DE SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NAGANO, Marcelo Seido e ARAÚJO, Daniella Castro. New heuristics for the no-wait flowshop with sequence-dependent setup times problem. Journal of Brazilian Society of Mechanical Sciences and Engineering, v. 36, p. 139-151, 2014Tradução . . Disponível em: https://doi.org/10.1007/s40430-013-0064-4. Acesso em: 24 jul. 2024.
APA
Nagano, M. S., & Araújo, D. C. (2014). New heuristics for the no-wait flowshop with sequence-dependent setup times problem. Journal of Brazilian Society of Mechanical Sciences and Engineering, 36, 139-151. doi:10.1007/s40430-013-0064-4
NLM
Nagano MS, Araújo DC. New heuristics for the no-wait flowshop with sequence-dependent setup times problem [Internet]. Journal of Brazilian Society of Mechanical Sciences and Engineering. 2014 ; 36 139-151.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/s40430-013-0064-4
Vancouver
Nagano MS, Araújo DC. New heuristics for the no-wait flowshop with sequence-dependent setup times problem [Internet]. Journal of Brazilian Society of Mechanical Sciences and Engineering. 2014 ; 36 139-151.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/s40430-013-0064-4
Artigo de periodico
An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem (2010)
Araújo, Daniella Castro; Nagano, Marcelo Seido
Source: Lecture Notes in Computer Science. Unidade: EESC
Subjects: HEURÍSTICA, ALGORITMOS DE SCHEDULING, ANÁLISE ESTATÍSTICA DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARAÚJO, Daniella Castro e NAGANO, Marcelo Seido. An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem. Lecture Notes in Computer Science, v. 6437, p. 187-196, 2010Tradução . . Disponível em: https://doi.org/10.1007/978-3-642-16761-4_17. Acesso em: 24 jul. 2024.
APA
Araújo, D. C., & Nagano, M. S. (2010). An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem. Lecture Notes in Computer Science, 6437, 187-196. doi:10.1007/978-3-642-16761-4_17
NLM
Araújo DC, Nagano MS. An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem [Internet]. Lecture Notes in Computer Science. 2010 ; 6437 187-196.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/978-3-642-16761-4_17
Vancouver
Araújo DC, Nagano MS. An effective heuristic for the no-wait flowshop with sequence-dependent setup times problem [Internet]. Lecture Notes in Computer Science. 2010 ; 6437 187-196.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/978-3-642-16761-4_17
Artigo de periodico
Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling (2007)
Ribeiro Filho, Geraldo; Nagano, Marcelo Seido; Lorena, Luiz Antonio Nogueira
Source: Lecture Notes in Computer Science. Unidade: EESC
Subjects: HEURÍSTICA, ALGORITMOS DE SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RIBEIRO FILHO, Geraldo e NAGANO, Marcelo Seido e LORENA, Luiz Antonio Nogueira. Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling. Lecture Notes in Computer Science, v. 4827, p. 1099-1109, 2007Tradução . . Disponível em: https://doi.org/10.1007/978-3-540-76631-5_105. Acesso em: 24 jul. 2024.
APA
Ribeiro Filho, G., Nagano, M. S., & Lorena, L. A. N. (2007). Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling. Lecture Notes in Computer Science, 4827, 1099-1109. doi:10.1007/978-3-540-76631-5_105
NLM
Ribeiro Filho G, Nagano MS, Lorena LAN. Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling [Internet]. Lecture Notes in Computer Science. 2007 ; 4827 1099-1109.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/978-3-540-76631-5_105
Vancouver
Ribeiro Filho G, Nagano MS, Lorena LAN. Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling [Internet]. Lecture Notes in Computer Science. 2007 ; 4827 1099-1109.[citado 2024 jul. 24 ] Available from: https://doi.org/10.1007/978-3-540-76631-5_105

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Indexado em