ReP USP - Resultado da busca

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
Source: IFAC Journal of Systems and Control. Unidade: EESC
Subjects: 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: 10 nov. 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 nov. 10 ] 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 nov. 10 ] Available from: https://dx.doi.org/10.1016/j.ifacsc.2024.100279
Trabalho de evento
An experimental analysis of regression-obtained HPC scheduling heuristics (2023)
Rosa, Lucas de Sousa ; Carastan-Santos, Danilo ; Goldman, Alfredo
Source: Proceedings. Conference titles: Workshop on Job Scheduling Strategies for Parallel Processing - JSSPP. Unidade: IME
Subjects: HEURÍSTICA, SCHEDULING, APRENDIZADO COMPUTACIONAL, REGRESSÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROSA, Lucas de Sousa e CARASTAN-SANTOS, Danilo e GOLDMAN, Alfredo. An experimental analysis of regression-obtained HPC scheduling heuristics. 2023, Anais.. Cham: Springer, 2023. Disponível em: https://doi.org/10.1007/978-3-031-43943-8_6. Acesso em: 10 nov. 2024.
APA
Rosa, L. de S., Carastan-Santos, D., & Goldman, A. (2023). An experimental analysis of regression-obtained HPC scheduling heuristics. In Proceedings. Cham: Springer. doi:10.1007/978-3-031-43943-8_6
NLM
Rosa L de S, Carastan-Santos D, Goldman A. An experimental analysis of regression-obtained HPC scheduling heuristics [Internet]. Proceedings. 2023 ;[citado 2024 nov. 10 ] Available from: https://doi.org/10.1007/978-3-031-43943-8_6
Vancouver
Rosa L de S, Carastan-Santos D, Goldman A. An experimental analysis of regression-obtained HPC scheduling heuristics [Internet]. Proceedings. 2023 ;[citado 2024 nov. 10 ] Available from: https://doi.org/10.1007/978-3-031-43943-8_6
Artigo de periodico
Unrelated parallel machine scheduling models with machine availability and eligibility constraints (2023)
Santoro, Miguel ; Junqueira, Leonardo
Source: Computers & Industrial Engineering. Unidade: EP
Subjects: SCHEDULING, PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE, PROGRAMAÇÃO MISTA, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTORO, Miguel e JUNQUEIRA, Leonardo. Unrelated parallel machine scheduling models with machine availability and eligibility constraints. Computers & Industrial Engineering, v. 179, p. 16 on-line, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2023.109219. Acesso em: 10 nov. 2024.
APA
Santoro, M., & Junqueira, L. (2023). Unrelated parallel machine scheduling models with machine availability and eligibility constraints. Computers & Industrial Engineering, 179, 16 on-line. doi:10.1016/j.cie.2023.109219
NLM
Santoro M, Junqueira L. Unrelated parallel machine scheduling models with machine availability and eligibility constraints [Internet]. Computers & Industrial Engineering. 2023 ; 179 16 on-line.[citado 2024 nov. 10 ] Available from: https://doi.org/10.1016/j.cie.2023.109219
Vancouver
Santoro M, Junqueira L. Unrelated parallel machine scheduling models with machine availability and eligibility constraints [Internet]. Computers & Industrial Engineering. 2023 ; 179 16 on-line.[citado 2024 nov. 10 ] Available from: https://doi.org/10.1016/j.cie.2023.109219
Artigo de periodico
Experimental study on full-scale glulam beams manufactured with Eucalyptus urograndis (2023)
Nogueira, Rodrigo de Souza ; Icimoto, Felipe Hideyoshi ; Calil Júnior, Carlito ; Lahr, Francisco Antonio Rocco
Source: Maderas. Unidade: EESC
Subjects: SEQUENCIAÇÃO DA PRODUÇÃO, SCHEDULING, GESTÃO DE PROJETOS, SIMULADORES DE VOO, INOVAÇÃO, MADEIRA, MADEIRA, MADEIRA, MADEIRA, ESTRUTURAS DE MADEIRA, LAMINADOS, ESTRUTURAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NOGUEIRA, Rodrigo de Souza et al. Experimental study on full-scale glulam beams manufactured with Eucalyptus urograndis. Maderas, v. 25, n. 5, p. 1-12, 2023Tradução . . Disponível em: https://doi.org/10.4067/s0718-221x2023000100405. Acesso em: 10 nov. 2024.
APA
Nogueira, R. de S., Icimoto, F. H., Calil Júnior, C., & Lahr, F. A. R. (2023). Experimental study on full-scale glulam beams manufactured with Eucalyptus urograndis. Maderas, 25( 5), 1-12. doi:10.4067/s0718-221x2023000100405
NLM
Nogueira R de S, Icimoto FH, Calil Júnior C, Lahr FAR. Experimental study on full-scale glulam beams manufactured with Eucalyptus urograndis [Internet]. Maderas. 2023 ; 25( 5): 1-12.[citado 2024 nov. 10 ] Available from: https://doi.org/10.4067/s0718-221x2023000100405
Vancouver
Nogueira R de S, Icimoto FH, Calil Júnior C, Lahr FAR. Experimental study on full-scale glulam beams manufactured with Eucalyptus urograndis [Internet]. Maderas. 2023 ; 25( 5): 1-12.[citado 2024 nov. 10 ] Available from: https://doi.org/10.4067/s0718-221x2023000100405
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: 10 nov. 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 nov. 10 ] 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 nov. 10 ] Available from: https://doi.org/10.1080/00207543.2022.2127959
Artigo de periodico
A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures (2022)
Geng, Tongsheng ; Amarís, Marcos ; Zuckerman, Stéphane ; Goldman, Alfredo ; Gao, Guang R.; Gaudiot, Jean-Luc
Source: International Journal of Parallel Programming. Unidade: IME
Subjects: APRENDIZADO COMPUTACIONAL, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GENG, Tongsheng et al. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures. International Journal of Parallel Programming, v. 50, n. 1, p. 115-151, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10766-021-00721-2. Acesso em: 10 nov. 2024.
APA
Geng, T., Amarís, M., Zuckerman, S., Goldman, A., Gao, G. R., & Gaudiot, J. -L. (2022). A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures. International Journal of Parallel Programming, 50( 1), 115-151. doi:10.1007/s10766-021-00721-2
NLM
Geng T, Amarís M, Zuckerman S, Goldman A, Gao GR, Gaudiot J-L. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures [Internet]. International Journal of Parallel Programming. 2022 ; 50( 1): 115-151.[citado 2024 nov. 10 ] Available from: https://doi.org/10.1007/s10766-021-00721-2
Vancouver
Geng T, Amarís M, Zuckerman S, Goldman A, Gao GR, Gaudiot J-L. A profile-based AI-assisted dynamic scheduling approach for heterogeneous architectures [Internet]. International Journal of Parallel Programming. 2022 ; 50( 1): 115-151.[citado 2024 nov. 10 ] Available from: https://doi.org/10.1007/s10766-021-00721-2
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: 10 nov. 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 nov. 10 ] 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 nov. 10 ] Available from: https://doi.org/10.1016/j.cie.2022.108366
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: 10 nov. 2024.
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 2024 nov. 10 ] 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 2024 nov. 10 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
Dissertação (Mestrado)
The no-wait flow shop scheduling problem with sequence-dependent setup times: a comprehensive review and an application of the ALNS algorithm (2021)
Reis, Viviane Souza Viléla Junqueira dos; Nagano, Marcelo Seido (Orientador)
Unidade: EESC
Subjects: SCHEDULING, SEQUENCIAÇÃO DA PRODUÇÃO, HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REIS, Viviane Souza Viléla Junqueira dos. The no-wait flow shop scheduling problem with sequence-dependent setup times: a comprehensive review and an application of the ALNS algorithm. 2021. Dissertação (Mestrado) – Universidade de São Paulo, São Carlos, 2021. Disponível em: https://www.teses.usp.br/teses/disponiveis/18/18156/tde-17082023-144657/. Acesso em: 10 nov. 2024.
APA
Reis, V. S. V. J. dos. (2021). The no-wait flow shop scheduling problem with sequence-dependent setup times: a comprehensive review and an application of the ALNS algorithm (Dissertação (Mestrado). Universidade de São Paulo, São Carlos. Recuperado de https://www.teses.usp.br/teses/disponiveis/18/18156/tde-17082023-144657/
NLM
Reis VSVJ dos. The no-wait flow shop scheduling problem with sequence-dependent setup times: a comprehensive review and an application of the ALNS algorithm [Internet]. 2021 ;[citado 2024 nov. 10 ] Available from: https://www.teses.usp.br/teses/disponiveis/18/18156/tde-17082023-144657/
Vancouver
Reis VSVJ dos. The no-wait flow shop scheduling problem with sequence-dependent setup times: a comprehensive review and an application of the ALNS algorithm [Internet]. 2021 ;[citado 2024 nov. 10 ] Available from: https://www.teses.usp.br/teses/disponiveis/18/18156/tde-17082023-144657/
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
Source: Computers & Industrial Engineering. Unidade: EESC
Subjects: 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: 10 nov. 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 nov. 10 ] 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 nov. 10 ] Available from: https://doi.org/10.1016/j.cie.2021.107337
Artigo de periodico
A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem (2020)
Viana, Monique Simplicio ; Morandin Junior, Orides ; Contreras, Rodrigo Colnago
Source: Sensors. Unidade: ICMC
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANA, Monique Simplicio e MORANDIN JUNIOR, Orides e CONTRERAS, Rodrigo Colnago. A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem. Sensors, v. 20, n. 18, p. Se 2020, 2020Tradução . . Disponível em: https://doi.org/10.3390/s20185440. Acesso em: 10 nov. 2024.
APA
Viana, M. S., Morandin Junior, O., & Contreras, R. C. (2020). A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem. Sensors, 20( 18), Se 2020. doi:10.3390/s20185440
NLM
Viana MS, Morandin Junior O, Contreras RC. A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem [Internet]. Sensors. 2020 ; 20( 18): Se 2020.[citado 2024 nov. 10 ] Available from: https://doi.org/10.3390/s20185440
Vancouver
Viana MS, Morandin Junior O, Contreras RC. A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem [Internet]. Sensors. 2020 ; 20( 18): Se 2020.[citado 2024 nov. 10 ] Available from: https://doi.org/10.3390/s20185440
Trabalho de evento
On-demand placement and scheduling of virtual network functions with software requirements (2020)
Santos, Giovanne Marcelo dos; Batista, Daniel Macêdo
Source: Proceedings. Conference titles: Latin-American Conference on Communications - LATINCOM. Unidade: IME
Assunto: SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTOS, Giovanne Marcelo dos e BATISTA, Daniel Macêdo. On-demand placement and scheduling of virtual network functions with software requirements. 2020, Anais.. Piscataway: IEEE, 2020. Disponível em: https://doi.org/10.1109/LATINCOM50620.2020.9282289. Acesso em: 10 nov. 2024.
APA
Santos, G. M. dos, & Batista, D. M. (2020). On-demand placement and scheduling of virtual network functions with software requirements. In Proceedings. Piscataway: IEEE. doi:10.1109/LATINCOM50620.2020.9282289
NLM
Santos GM dos, Batista DM. On-demand placement and scheduling of virtual network functions with software requirements [Internet]. Proceedings. 2020 ;[citado 2024 nov. 10 ] Available from: https://doi.org/10.1109/LATINCOM50620.2020.9282289
Vancouver
Santos GM dos, Batista DM. On-demand placement and scheduling of virtual network functions with software requirements [Internet]. Proceedings. 2020 ;[citado 2024 nov. 10 ] Available from: https://doi.org/10.1109/LATINCOM50620.2020.9282289
Trabalho de evento
PDAWL: profile-based iterative dynamic adaptive workload balance on heterogeneous architectures (2020)
Geng, Tongsheng; Amarís, Marcos; Zuckerman, Stéphane ; Goldman, Alfredo ; Gao, Guang R; Gaudiot, Jean-Luc
Source: Proceedings. Conference titles: Workshop on Job Scheduling Strategies for Parallel Processing - JSSPP. Unidade: IME
Subjects: MÉTODOS ITERATIVOS, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GENG, Tongsheng et al. PDAWL: profile-based iterative dynamic adaptive workload balance on heterogeneous architectures. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-63171-0_8. Acesso em: 10 nov. 2024.
APA
Geng, T., Amarís, M., Zuckerman, S., Goldman, A., Gao, G. R., & Gaudiot, J. -L. (2020). PDAWL: profile-based iterative dynamic adaptive workload balance on heterogeneous architectures. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-63171-0_8
NLM
Geng T, Amarís M, Zuckerman S, Goldman A, Gao GR, Gaudiot J-L. PDAWL: profile-based iterative dynamic adaptive workload balance on heterogeneous architectures [Internet]. Proceedings. 2020 ;[citado 2024 nov. 10 ] Available from: https://doi.org/10.1007/978-3-030-63171-0_8
Vancouver
Geng T, Amarís M, Zuckerman S, Goldman A, Gao GR, Gaudiot J-L. PDAWL: profile-based iterative dynamic adaptive workload balance on heterogeneous architectures [Internet]. Proceedings. 2020 ;[citado 2024 nov. 10 ] Available from: https://doi.org/10.1007/978-3-030-63171-0_8
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.
Source: Computers & Industrial Engineering. Unidade: EESC
Subjects: 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: 10 nov. 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 nov. 10 ] 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 nov. 10 ] Available from: https://doi.org/10.1016/j.cie.2019.05.034
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
Source: Swarm and Evolutionary Computation. Unidade: EESC
Subjects: 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: 10 nov. 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 nov. 10 ] 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 nov. 10 ] Available from: https://doi.org/10.1016/j.swevo.2018.08.001
Artigo de periodico
The blocking flow shop scheduling problem: a comprehensive and conceptual review (2019)
Miyata, Hugo Hissashi ; Nagano, Marcelo Seido
Source: Expert Systems with Applications: an international journal. Unidade: EESC
Subjects: SCHEDULING, FLUXOGRAMA, LOJAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYATA, Hugo Hissashi e NAGANO, Marcelo Seido. The blocking flow shop scheduling problem: a comprehensive and conceptual review. Expert Systems with Applications: an international journal, v. 135, p. 130-156, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2019.06.069. Acesso em: 10 nov. 2024.
APA
Miyata, H. H., & Nagano, M. S. (2019). The blocking flow shop scheduling problem: a comprehensive and conceptual review. Expert Systems with Applications: an international journal, 135, 130-156. doi:10.1016/j.eswa.2019.06.069
NLM
Miyata HH, Nagano MS. The blocking flow shop scheduling problem: a comprehensive and conceptual review [Internet]. Expert Systems with Applications: an international journal. 2019 ; 135 130-156.[citado 2024 nov. 10 ] Available from: https://doi.org/10.1016/j.eswa.2019.06.069
Vancouver
Miyata HH, Nagano MS. The blocking flow shop scheduling problem: a comprehensive and conceptual review [Internet]. Expert Systems with Applications: an international journal. 2019 ; 135 130-156.[citado 2024 nov. 10 ] Available from: https://doi.org/10.1016/j.eswa.2019.06.069
Dissertação (Mestrado)
Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo (2019)
Souza, Fernanda Gonçalves; Park, Song Won (Orientador)
Unidade: EP
Subjects: HEURÍSTICA, PETRÓLEO, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SOUZA, Fernanda Gonçalves. Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo. 2019. Dissertação (Mestrado) – Universidade de São Paulo, São Paulo, 2019. Disponível em: https://teses.usp.br/teses/disponiveis/3/3137/tde-22112019-141951/. Acesso em: 10 nov. 2024.
APA
Souza, F. G. (2019). Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo (Dissertação (Mestrado). Universidade de São Paulo, São Paulo. Recuperado de https://teses.usp.br/teses/disponiveis/3/3137/tde-22112019-141951/
NLM
Souza FG. Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo [Internet]. 2019 ;[citado 2024 nov. 10 ] Available from: https://teses.usp.br/teses/disponiveis/3/3137/tde-22112019-141951/
Vancouver
Souza FG. Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo [Internet]. 2019 ;[citado 2024 nov. 10 ] Available from: https://teses.usp.br/teses/disponiveis/3/3137/tde-22112019-141951/
Artigo de periodico
Scaling up modulo scheduling for high-level synthesis (2019)
Rosa, Leandro de Souza; Bouganis, Christos-Savvas; Bonato, Vanderlei
Source: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. Unidade: ICMC
Subjects: CIRCUITOS FPGA, ALGORITMOS GENÉTICOS, COMPUTAÇÃO RECONFIGURÁVEL, ALGORITMOS DE SCHEDULING, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROSA, Leandro de Souza e BOUGANIS, Christos-Savvas e BONATO, Vanderlei. Scaling up modulo scheduling for high-level synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, v. 38, n. 5, p. 912-925, 2019Tradução . . Disponível em: https://doi.org/10.1109/TCAD.2018.2834440. Acesso em: 10 nov. 2024.
APA
Rosa, L. de S., Bouganis, C. -S., & Bonato, V. (2019). Scaling up modulo scheduling for high-level synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 38( 5), 912-925. doi:10.1109/TCAD.2018.2834440
NLM
Rosa L de S, Bouganis C-S, Bonato V. Scaling up modulo scheduling for high-level synthesis [Internet]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2019 ; 38( 5): 912-925.[citado 2024 nov. 10 ] Available from: https://doi.org/10.1109/TCAD.2018.2834440
Vancouver
Rosa L de S, Bouganis C-S, Bonato V. Scaling up modulo scheduling for high-level synthesis [Internet]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2019 ; 38( 5): 912-925.[citado 2024 nov. 10 ] Available from: https://doi.org/10.1109/TCAD.2018.2834440
Trabalho de evento
Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas (2019)
Birgin, Ernesto Julian Goldberg ; Jesus Filho, José Eurípedes Ferreira de; Ronconi, Débora Pretti
Source: Anais. Conference titles: Simpósio Brasileiro de Pesquisa Operacional. Unidades: IME, EP
Subjects: SCHEDULING, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e JESUS FILHO, José Eurípedes Ferreira de e RONCONI, Débora Pretti. Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas. 2019, Anais.. Rio de Janeiro: SOBRAPO, 2019. Disponível em: https://repositorio.usp.br/directbitstream/fcef5738-1f07-4f21-a24f-888d2242f659/3026922.pdf. Acesso em: 10 nov. 2024.
APA
Birgin, E. J. G., Jesus Filho, J. E. F. de, & Ronconi, D. P. (2019). Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas. In Anais. Rio de Janeiro: SOBRAPO. Recuperado de https://repositorio.usp.br/directbitstream/fcef5738-1f07-4f21-a24f-888d2242f659/3026922.pdf
NLM
Birgin EJG, Jesus Filho JEF de, Ronconi DP. Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas [Internet]. Anais. 2019 ;[citado 2024 nov. 10 ] Available from: https://repositorio.usp.br/directbitstream/fcef5738-1f07-4f21-a24f-888d2242f659/3026922.pdf
Vancouver
Birgin EJG, Jesus Filho JEF de, Ronconi DP. Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas [Internet]. Anais. 2019 ;[citado 2024 nov. 10 ] Available from: https://repositorio.usp.br/directbitstream/fcef5738-1f07-4f21-a24f-888d2242f659/3026922.pdf
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: 10 nov. 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 nov. 10 ] 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 nov. 10 ] Available from: https://doi.org/10.1080/0305215X.2018.1485903

USP Schools

ReP

Filtros

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration

Área de concentração

Sigla do Departamento/Programa de Pós Graduação

Departamento/Programa de Pós Graduação