ReP USP - Resultado da busca

Artigo de periodico
A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (2022)
Abreu, Levi Ribeiro de; Araujo, Kennedy Anderson Guimarães de ; Prata, Bruno de Athayde; Nagano, Marcelo Seido ; Moccellin, João Vitor
Source: Engineering Optimization. Unidades: EESC, IME
Assunto: ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ABREU, Levi Ribeiro de et al. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, v. 54, n. 9, p. 1563-1582, 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2021.1957101. Acesso em: 27 nov. 2025.
APA
Abreu, L. R. de, Araujo, K. A. G. de, Prata, B. de A., Nagano, M. S., & Moccellin, J. V. (2022). A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, 54( 9), 1563-1582. doi:10.1080/0305215X.2021.1957101
NLM
Abreu LR de, Araujo KAG de, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101
Vancouver
Abreu LR de, Araujo KAG de, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101
Artigo de periodico
A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (2022)
Prata, Bruno de Athayde; Nagano, Marcelo Seido
Source: Engineering Optimization. Unidade: EESC
Subjects: PROGRAMAÇÃO DA PRODUÇÃO, SCHEDULING, ALGORITMOS DE SCHEDULING, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PRATA, Bruno de Athayde e NAGANO, Marcelo Seido. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, p. [1-15], 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2022.2144274. Acesso em: 27 nov. 2025.
APA
Prata, B. de A., & Nagano, M. S. (2022). A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, [1-15]. doi:10.1080/0305215X.2022.2144274
NLM
Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
Vancouver
Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
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: 27 nov. 2025.
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 2025 nov. 27 ] 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 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000
Artigo de periodico
Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study (2018)
Miyata, Hugo Hissashi ; Nagano, Marcelo Seido ; Guptab, Jatinder N. D.
Source: Engineering Optimization. Unidade: EESC
Subjects: MANUTENÇÃO PREVENTIVA, HEURÍSTICA, SCHEDULING
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 GUPTAB, Jatinder N. D. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study. Engineering Optimization, v. 51, n. 4, 2018Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2018.1485903. Acesso em: 27 nov. 2025.
APA
Miyata, H. H., Nagano, M. S., & Guptab, J. N. D. (2018). Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study. Engineering Optimization, 51( 4). doi:10.1080/0305215X.2018.1485903
NLM
Miyata HH, Nagano MS, Guptab JND. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study [Internet]. Engineering Optimization. 2018 ; 51( 4):[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2018.1485903
Vancouver
Miyata HH, Nagano MS, Guptab JND. Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study [Internet]. Engineering Optimization. 2018 ; 51( 4):[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2018.1485903
Artigo de periodico
High-performing heuristics to minimize flowtime in no-idle permutation flowshop (2018)
Nagano, Marcelo Seido ; Rossi, Fernando Luis; Martarelli, Nádia Junqueira
Source: Engineering Optimization. Unidade: EESC
Subjects: HEURÍSTICA, SCHEDULING
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 MARTARELLI, Nádia Junqueira. High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Engineering Optimization, v. 51, n. 2, 2018Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2018.1444163. Acesso em: 27 nov. 2025.
APA
Nagano, M. S., Rossi, F. L., & Martarelli, N. J. (2018). High-performing heuristics to minimize flowtime in no-idle permutation flowshop. Engineering Optimization, 51( 2). doi:10.1080/0305215X.2018.1444163
NLM
Nagano MS, Rossi FL, Martarelli NJ. High-performing heuristics to minimize flowtime in no-idle permutation flowshop [Internet]. Engineering Optimization. 2018 ; 51( 2):[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2018.1444163
Vancouver
Nagano MS, Rossi FL, Martarelli NJ. High-performing heuristics to minimize flowtime in no-idle permutation flowshop [Internet]. Engineering Optimization. 2018 ; 51( 2):[citado 2025 nov. 27 ] Available from: https://doi.org/10.1080/0305215X.2018.1444163

USP Schools

ReP

Filtros

Authors

USP affiliated authors

Subjects

Funding Agencies