ReP USP - Resultado da busca

Artigo de periodico
Evaluating procedures in the NEH heuristic for the PFSP - SIST (2024)
Laurentys, Clarissa Tararam de; Nagano, Marcelo Seido
Fonte: Journal of Project Management. Unidade: EESC
Assuntos: HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO, SEQUENCIAÇÃO DA PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LAURENTYS, Clarissa Tararam de e NAGANO, Marcelo Seido. Evaluating procedures in the NEH heuristic for the PFSP - SIST. Journal of Project Management, v. 9, n. 1, p. 17-26, 2024Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2023.11.001. Acesso em: 17 out. 2024.
APA
Laurentys, C. T. de, & Nagano, M. S. (2024). Evaluating procedures in the NEH heuristic for the PFSP - SIST. Journal of Project Management, 9( 1), 17-26. doi:10.5267/j.jpm.2023.11.001
NLM
Laurentys CT de, Nagano MS. Evaluating procedures in the NEH heuristic for the PFSP - SIST [Internet]. Journal of Project Management. 2024 ; 9( 1): 17-26.[citado 2024 out. 17 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.11.001
Vancouver
Laurentys CT de, Nagano MS. Evaluating procedures in the NEH heuristic for the PFSP - SIST [Internet]. Journal of Project Management. 2024 ; 9( 1): 17-26.[citado 2024 out. 17 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.11.001
Artigo de periodico
A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time (2024)
Nagano, Marcelo Seido ; Rossi, Fernando Luis
Fonte: Journal of Project Management. Unidade: EESC
Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, HEURÍSTICA, 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 ROSSI, Fernando Luis. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time. Journal of Project Management, v. 9, n. 1, p. 45-60, 2024Tradução . . Disponível em: https://dx.doi.org/10.5267/j.jpm.2023.9.001. Acesso em: 17 out. 2024.
APA
Nagano, M. S., & Rossi, F. L. (2024). A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time. Journal of Project Management, 9( 1), 45-60. doi:10.5267/j.jpm.2023.9.001
NLM
Nagano MS, Rossi FL. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Journal of Project Management. 2024 ; 9( 1): 45-60.[citado 2024 out. 17 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.9.001
Vancouver
Nagano MS, Rossi FL. A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Journal of Project Management. 2024 ; 9( 1): 45-60.[citado 2024 out. 17 ] Available from: https://dx.doi.org/10.5267/j.jpm.2023.9.001
Artigo de periodico
An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times (2024)
Nagano, Marcelo Seido ; Junqueira, Viviane Souza Vilela; Rossi, Fernando Luis
Fonte: IFAC Journal of Systems and Control. Unidade: EESC
Assuntos: SEQUENCIAÇÃO DA PRODUÇÃO, HEURÍSTICA, SCHEDULING, 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 JUNQUEIRA, Viviane Souza Vilela e ROSSI, Fernando Luis. An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times. IFAC Journal of Systems and Control, v. 29, p. 1-10, 2024Tradução . . Disponível em: https://dx.doi.org/10.1016/j.ifacsc.2024.100279. Acesso em: 17 out. 2024.
APA
Nagano, M. S., Junqueira, V. S. V., & Rossi, F. L. (2024). An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times. IFAC Journal of Systems and Control, 29, 1-10. doi:10.1016/j.ifacsc.2024.100279
NLM
Nagano MS, Junqueira VSV, Rossi FL. An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times [Internet]. IFAC Journal of Systems and Control. 2024 ; 29 1-10.[citado 2024 out. 17 ] Available from: https://dx.doi.org/10.1016/j.ifacsc.2024.100279
Vancouver
Nagano MS, Junqueira VSV, Rossi FL. An objective review and perspectives on the permutation flowshop scheduling with no-wait constraint and setup times [Internet]. IFAC Journal of Systems and Control. 2024 ; 29 1-10.[citado 2024 out. 17 ] Available from: https://dx.doi.org/10.1016/j.ifacsc.2024.100279
Artigo de periodico
Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (2023)
Rolim, Gustavo Alencar; Nagano, Marcelo Seido ; Prata, Bruno de Athayde
Fonte: Computers and Operations Research. Unidade: EESC
Assuntos: BENCHMARKS, HEURÍSTICA, SEMICONDUTORES, 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. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, v. 153, p. 1-18, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2023.106159. Acesso em: 17 out. 2024.
APA
Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2023). Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, 153, 1-18. doi:10.1016/j.cor.2023.106159
NLM
Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
Vancouver
Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
Artigo de periodico
Beam search-based heuristics for the mixed no-idle fowshop with total fowtime criterion (2022)
Rossi, Fernando Luis; Nagano, Marcelo Seido
Fonte: OR Spectrum. Unidade: EESC
Assuntos: 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: 17 out. 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 out. 17 ] 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 out. 17 ] Available from: https://doi.org/10.1007/s00291-022-00678-9
Trabalho de evento-resumo
Heurística ALNS para problemas de programação de no-wait flowshop mistos (2022)
Verzelloni, João Victor Pascualote ; Nagano, Marcelo Seido
Fonte: Livro de Resumos Expandidos. Nome do evento: Simpósio Internacional de Iniciação Científica e Tecnológica da Universidade de São Paulo - SIICUSP. Unidade: EESC
Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, HEURÍSTICA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VERZELLONI, João Victor Pascualote e NAGANO, Marcelo Seido. Heurística ALNS para problemas de programação de no-wait flowshop mistos. 2022, Anais.. São Carlos, SP: EESC/USP, 2022. Disponível em: http://soac.eesc.usp.br/index.php/siicusp/30siicusp/paper/viewFile/3526/2355. Acesso em: 17 out. 2024.
APA
Verzelloni, J. V. P., & Nagano, M. S. (2022). Heurística ALNS para problemas de programação de no-wait flowshop mistos. In Livro de Resumos Expandidos. São Carlos, SP: EESC/USP. Recuperado de http://soac.eesc.usp.br/index.php/siicusp/30siicusp/paper/viewFile/3526/2355
NLM
Verzelloni JVP, Nagano MS. Heurística ALNS para problemas de programação de no-wait flowshop mistos [Internet]. Livro de Resumos Expandidos. 2022 ;[citado 2024 out. 17 ] Available from: http://soac.eesc.usp.br/index.php/siicusp/30siicusp/paper/viewFile/3526/2355
Vancouver
Verzelloni JVP, Nagano MS. Heurística ALNS para problemas de programação de no-wait flowshop mistos [Internet]. Livro de Resumos Expandidos. 2022 ;[citado 2024 out. 17 ] Available from: http://soac.eesc.usp.br/index.php/siicusp/30siicusp/paper/viewFile/3526/2355
Artigo de periodico
Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times (2022)
Almeida, Fernando Siqueira de ; Nagano, Marcelo Seido
Fonte: Journal of the Operational Research Society. Unidade: EESC
Assuntos: SEQUENCIAÇÃO DA PRODUÇÃO, HEURÍSTICA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALMEIDA, Fernando Siqueira de e NAGANO, Marcelo Seido. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society, p. 1-12, 2022Tradução . . Disponível em: https://doi.org/10.1080/01605682.2022.2039569. Acesso em: 17 out. 2024.
APA
Almeida, F. S. de, & Nagano, M. S. (2022). Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. Journal of the Operational Research Society, 1-12. doi:10.1080/01605682.2022.2039569
NLM
Almeida FS de, Nagano MS. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2022 ; 1-12.[citado 2024 out. 17 ] Available from: https://doi.org/10.1080/01605682.2022.2039569
Vancouver
Almeida FS de, Nagano MS. Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2022 ; 1-12.[citado 2024 out. 17 ] Available from: https://doi.org/10.1080/01605682.2022.2039569
Trabalho de evento-resumo
Heurística ALNS para o problema de sequenciamento em máquina única com tempos de setup entre famílias e restrições de recursos (2021)
Hayakawa, Larissa Satie; Nagano, Marcelo Seido
Fonte: Livro de Resumos Expandidos. Nome do evento: Simpósio Internacional de Iniciação Científica e Tecnológica da Universidade de São Paulo - SIICUSP. Unidade: EESC
Assuntos: SEQUENCIAÇÃO DA PRODUÇÃO, HEURÍSTICA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAYAKAWA, Larissa Satie e NAGANO, Marcelo Seido. Heurística ALNS para o problema de sequenciamento em máquina única com tempos de setup entre famílias e restrições de recursos. 2021, Anais.. São Carlos, SP: EESC/USP, 2021. Disponível em: http://soac.eesc.usp.br/index.php/siicusp/29siicusp/paper/viewFile/3314/2124. Acesso em: 17 out. 2024.
APA
Hayakawa, L. S., & Nagano, M. S. (2021). Heurística ALNS para o problema de sequenciamento em máquina única com tempos de setup entre famílias e restrições de recursos. In Livro de Resumos Expandidos. São Carlos, SP: EESC/USP. Recuperado de http://soac.eesc.usp.br/index.php/siicusp/29siicusp/paper/viewFile/3314/2124
NLM
Hayakawa LS, Nagano MS. Heurística ALNS para o problema de sequenciamento em máquina única com tempos de setup entre famílias e restrições de recursos [Internet]. Livro de Resumos Expandidos. 2021 ;[citado 2024 out. 17 ] Available from: http://soac.eesc.usp.br/index.php/siicusp/29siicusp/paper/viewFile/3314/2124
Vancouver
Hayakawa LS, Nagano MS. Heurística ALNS para o problema de sequenciamento em máquina única com tempos de setup entre famílias e restrições de recursos [Internet]. Livro de Resumos Expandidos. 2021 ;[citado 2024 out. 17 ] Available from: http://soac.eesc.usp.br/index.php/siicusp/29siicusp/paper/viewFile/3314/2124
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
Fonte: Arabian Journal for Science and Engineering. Unidade: EESC
Assuntos: 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: 17 out. 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 out. 17 ] 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 out. 17 ] Available from: https://doi.org/10.1007/s13369-021-06244-9
Artigo de periodico
Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times (2021)
Rossi, Fernando Luis; Nagano, Marcelo Seido
Fonte: Computers & Industrial Engineering. Unidade: EESC
Assuntos: SCHEDULING, ALGORITMOS GENÉTICOS, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROSSI, Fernando Luis e NAGANO, Marcelo Seido. Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times. Computers & Industrial Engineering, v. 157, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2021.107337. Acesso em: 17 out. 2024.
APA
Rossi, F. L., & Nagano, M. S. (2021). Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times. Computers & Industrial Engineering, 157. doi:10.1016/j.cie.2021.107337
NLM
Rossi FL, Nagano MS. Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times [Internet]. Computers & Industrial Engineering. 2021 ; 157[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cie.2021.107337
Vancouver
Rossi FL, Nagano MS. Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times [Internet]. Computers & Industrial Engineering. 2021 ; 157[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cie.2021.107337
Artigo de periodico
Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance (2021)
Yamada, Tuane Tonani; Nagano, Marcelo Seido ; Miyata, Hugo Hissashi
Fonte: International Journal of Industrial Engineering Computations. Unidade: EESC
Assuntos: SISTEMAS DE PRODUÇÃO, PROGRAMAÇÃO DA PRODUÇÃO, MANUTENÇÃO PREVENTIVA, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
YAMADA, Tuane Tonani e NAGANO, Marcelo Seido e MIYATA, Hugo Hissashi. Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance. International Journal of Industrial Engineering Computations, v. 12, p. 415-426, 2021Tradução . . Disponível em: https://doi.org/10.5267/j.ijiec.2021.5.002. Acesso em: 17 out. 2024.
APA
Yamada, T. T., Nagano, M. S., & Miyata, H. H. (2021). Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance. International Journal of Industrial Engineering Computations, 12, 415-426. doi:10.5267/j.ijiec.2021.5.002
NLM
Yamada TT, Nagano MS, Miyata HH. Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance [Internet]. International Journal of Industrial Engineering Computations. 2021 ; 12 415-426.[citado 2024 out. 17 ] Available from: https://doi.org/10.5267/j.ijiec.2021.5.002
Vancouver
Yamada TT, Nagano MS, Miyata HH. Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance [Internet]. International Journal of Industrial Engineering Computations. 2021 ; 12 415-426.[citado 2024 out. 17 ] Available from: https://doi.org/10.5267/j.ijiec.2021.5.002
Artigo de periodico
Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation (2020)
Rossi, Fernando Luis; Nagano, Marcelo Seido
Fonte: Swarm and Evolutionary Computation. Unidade: EESC
Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, HEURÍSTICA, 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. Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation. Swarm and Evolutionary Computation, v. 55, p. 1-19, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.swevo.2020.100689. Acesso em: 17 out. 2024.
APA
Rossi, F. L., & Nagano, M. S. (2020). Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation. Swarm and Evolutionary Computation, 55, 1-19. doi:10.1016/j.swevo.2020.100689
NLM
Rossi FL, Nagano MS. Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation [Internet]. Swarm and Evolutionary Computation. 2020 ; 55 1-19.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.swevo.2020.100689
Vancouver
Rossi FL, Nagano MS. Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation [Internet]. Swarm and Evolutionary Computation. 2020 ; 55 1-19.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.swevo.2020.100689
Artigo de periodico
Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization (2019)
Miyata, Hugo Hissashi ; Nagano, Marcelo Seido ; Gupta, Jatinder N. D.
Fonte: Computers & Industrial Engineering. Unidade: EESC
Assuntos: HEURÍSTICA, SCHEDULING, SEQUENCIAÇÃO DA PRODUÇÃO, MANUTENÇÃO PREVENTIVA
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. Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Computers & Industrial Engineering, v. 135, p. Se 2019, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2019.05.034. Acesso em: 17 out. 2024.
APA
Miyata, H. H., Nagano, M. S., & Gupta, J. N. D. (2019). Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Computers & Industrial Engineering, 135, Se 2019. doi:10.1016/j.cie.2019.05.034
NLM
Miyata HH, Nagano MS, Gupta JND. Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization [Internet]. Computers & Industrial Engineering. 2019 ; 135 Se 2019.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cie.2019.05.034
Vancouver
Miyata HH, Nagano MS, Gupta JND. Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization [Internet]. Computers & Industrial Engineering. 2019 ; 135 Se 2019.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.cie.2019.05.034
Artigo de periodico
Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion (2019)
Rossi, Fernando Luis; Nagano, Marcelo Seido
Fonte: Expert Systems with Applications: an international journal. Unidade: EESC
Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, HEURÍSTICA, TEMPO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROSSI, Fernando Luis e NAGANO, Marcelo Seido. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion. Expert Systems with Applications: an international journal, v. 125, p. 40-54, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2019.01.057. Acesso em: 17 out. 2024.
APA
Rossi, F. L., & Nagano, M. S. (2019). Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion. Expert Systems with Applications: an international journal, 125, 40-54. doi:10.1016/j.eswa.2019.01.057
NLM
Rossi FL, Nagano MS. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion [Internet]. Expert Systems with Applications: an international journal. 2019 ; 125 40-54.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.eswa.2019.01.057
Vancouver
Rossi FL, Nagano MS. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion [Internet]. Expert Systems with Applications: an international journal. 2019 ; 125 40-54.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.eswa.2019.01.057
Artigo de periodico
Heuristics for the mixed no-idle flowshop with sequence-dependent setup times (2019)
Rossi, Fernando Luis; Nagano, Marcelo Seido
Fonte: Journal of the Operational Research Society. Unidade: EESC
Assuntos: 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
ROSSI, Fernando Luis e NAGANO, Marcelo Seido. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times. Journal of the Operational Research Society, 2019Tradução . . Disponível em: https://doi.org/10.1080/01605682.2019.1671149. Acesso em: 17 out. 2024.
APA
Rossi, F. L., & Nagano, M. S. (2019). Heuristics for the mixed no-idle flowshop with sequence-dependent setup times. Journal of the Operational Research Society. doi:10.1080/01605682.2019.1671149
NLM
Rossi FL, Nagano MS. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2019 ;[citado 2024 out. 17 ] Available from: https://doi.org/10.1080/01605682.2019.1671149
Vancouver
Rossi FL, Nagano MS. Heuristics for the mixed no-idle flowshop with sequence-dependent setup times [Internet]. Journal of the Operational Research Society. 2019 ;[citado 2024 out. 17 ] Available from: https://doi.org/10.1080/01605682.2019.1671149
Artigo de periodico
An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle (2019)
Tavares Neto, Roberto Fernandes; Nagano, Marcelo Seido
Fonte: Swarm and Evolutionary Computation. Unidade: EESC
Assuntos: SCHEDULING, ALGORITMOS DE SCHEDULING, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TAVARES NETO, Roberto Fernandes e NAGANO, Marcelo Seido. An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle. Swarm and Evolutionary Computation, v. 44, p. 612-621, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.swevo.2018.08.001. Acesso em: 17 out. 2024.
APA
Tavares Neto, R. F., & Nagano, M. S. (2019). An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle. Swarm and Evolutionary Computation, 44, 612-621. doi:10.1016/j.swevo.2018.08.001
NLM
Tavares Neto RF, Nagano MS. An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle [Internet]. Swarm and Evolutionary Computation. 2019 ; 44 612-621.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.swevo.2018.08.001
Vancouver
Tavares Neto RF, Nagano MS. An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle [Internet]. Swarm and Evolutionary Computation. 2019 ; 44 612-621.[citado 2024 out. 17 ] Available from: https://doi.org/10.1016/j.swevo.2018.08.001
Artigo de periodico
Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times (2019)
Takano, Mauricio Iwama ; Nagano, Marcelo Seido
Fonte: International Journal of Industrial Engineering Computations. Unidade: EESC
Assuntos: PROGRAMAÇÃO DA PRODUÇÃO, HEURÍSTICA, TEMPO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TAKANO, Mauricio Iwama e NAGANO, Marcelo Seido. Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times. International Journal of Industrial Engineering Computations, v. 10, p. 37-50, 2019Tradução . . Disponível em: https://doi.org/10.5267/j.ijiec.2018.5.002. Acesso em: 17 out. 2024.
APA
Takano, M. I., & Nagano, M. S. (2019). Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times. International Journal of Industrial Engineering Computations, 10, 37-50. doi:10.5267/j.ijiec.2018.5.002
NLM
Takano MI, Nagano MS. Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times [Internet]. International Journal of Industrial Engineering Computations. 2019 ; 10 37-50.[citado 2024 out. 17 ] Available from: https://doi.org/10.5267/j.ijiec.2018.5.002
Vancouver
Takano MI, Nagano MS. Evaluating the performance of constructive heuristics for the blocking flow shop scheduling problem with setup times [Internet]. International Journal of Industrial Engineering Computations. 2019 ; 10 37-50.[citado 2024 out. 17 ] Available from: https://doi.org/10.5267/j.ijiec.2018.5.002
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.
Fonte: Engineering Optimization. Unidade: EESC
Assuntos: 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: 17 out. 2024.
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 2024 out. 17 ] 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 2024 out. 17 ] 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
Fonte: Engineering Optimization. Unidade: EESC
Assuntos: 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: 17 out. 2024.
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 2024 out. 17 ] 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 2024 out. 17 ] Available from: https://doi.org/10.1080/0305215X.2018.1444163
Artigo de periodico
Glass container production planning with warm-ups and furnace extraction variation losses (2017)
Fachini, Ramon Faganello; Esposto, Kleber Francisco; Camargo, Victor Claudio Bento de
Fonte: International Journal of Advanced Manufacturing Technology. Unidade: EESC
Assuntos: PLANEJAMENTO DA PRODUÇÃO, PROGRAMAÇÃO MATEMÁTICA, HEURÍSTICA, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FACHINI, Ramon Faganello e ESPOSTO, Kleber Francisco e CAMARGO, Victor Claudio Bento de. Glass container production planning with warm-ups and furnace extraction variation losses. International Journal of Advanced Manufacturing Technology, v. 90, n. 1, p. 527-543, 2017Tradução . . Disponível em: https://doi.org/10.1007/s00170-016-9369-7. Acesso em: 17 out. 2024.
APA
Fachini, R. F., Esposto, K. F., & Camargo, V. C. B. de. (2017). Glass container production planning with warm-ups and furnace extraction variation losses. International Journal of Advanced Manufacturing Technology, 90( 1), 527-543. doi:10.1007/s00170-016-9369-7
NLM
Fachini RF, Esposto KF, Camargo VCB de. Glass container production planning with warm-ups and furnace extraction variation losses [Internet]. International Journal of Advanced Manufacturing Technology. 2017 ; 90( 1): 527-543.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/s00170-016-9369-7
Vancouver
Fachini RF, Esposto KF, Camargo VCB de. Glass container production planning with warm-ups and furnace extraction variation losses [Internet]. International Journal of Advanced Manufacturing Technology. 2017 ; 90( 1): 527-543.[citado 2024 out. 17 ] Available from: https://doi.org/10.1007/s00170-016-9369-7

Unidades USP

ReP

Filtros

Autores

Autores USP

Ano de publicação

Assuntos

Título da fonte

Editora

Nome do evento

País de publicação

Agência de fomento

Indexado em

Afiliação dos autores externos não normalizada