default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcelo Seido Nagano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j46]Fernando Siqueira de Almeida
, Marcelo Seido Nagano:
An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times. 4OR 22(1): 31-45 (2024)- 2023
- [j45]Fernando Montenegro-Dos Santos, Francisco Pérez-Galarce, Carlos Monardes-Concha, Alfredo Candia-Véjar, Marcelo Seido Nagano, Javier E. Gómez-Lagos:
A Rolling Horizon scheme for rescheduling in agricultural harvest. Comput. Electron. Agric. 215: 108392 (2023) - [j44]Gustavo Alencar Rolim, Marcelo Seido Nagano, Bruno de Athayde Prata:
Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Comput. Oper. Res. 153: 106159 (2023) - [j43]Levi Ribeiro de Abreu, Bruno A. Prata, Marcelo Seido Nagano, Jose M. Framiñan:
A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization. Comput. Oper. Res. 160: 106386 (2023) - [j42]Hugo Hissashi Miyata, Marcelo Seido Nagano, Jatinder N. D. Gupta:
Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function. Int. J. Prod. Res. 61(19): 6308-6335 (2023) - [j41]Levi Ribeiro de Abreu, Marcelo Seido Nagano, Bruno A. Prata:
A new two-stage constraint programming approach for open shop scheduling problem with machine blocking. Int. J. Prod. Res. 61(24): 8560-8579 (2023) - [j40]Fernando Siqueira de Almeida, Marcelo Seido Nagano:
Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times. J. Oper. Res. Soc. 74(1): 362-373 (2023) - [j39]Bruno de Athayde Prata, Marcelo Seido Nagano, Nádia Junqueira Martarelli, Levi Ribeiro de Abreu:
The Seeds of the NEH Algorithm: An Overview Using Bibliometric Analysis. Oper. Res. Forum 4(4): 98 (2023) - 2022
- [j38]Levi Ribeiro de Abreu, Marcelo Seido Nagano:
A new hybridization of adaptive large neighborhood search with constraint programming for open shop scheduling with sequence-dependent setup times. Comput. Ind. Eng. 168: 108128 (2022) - [j37]Mário Tonizza Pereira, Marcelo Seido Nagano:
Hybrid metaheuristics for the integrated and detailed scheduling of production and delivery operations in no-wait flow shop systems. Comput. Ind. Eng. 170: 108255 (2022) - [j36]Hugo Hissashi Miyata, Marcelo Seido Nagano:
An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan. Comput. Ind. Eng. 171: 108366 (2022) - [j35]Levi Ribeiro de Abreu, Bruno A. Prata, Jose M. Framiñan, Marcelo Seido Nagano:
New efficient heuristics for scheduling open shops with makespan minimization. Comput. Oper. Res. 142: 105744 (2022) - [j34]Edson Antônio Gonçalves de Souza, Marcelo Seido Nagano, Gustavo Alencar Rolim:
Dynamic Programming algorithms and their applications in machine scheduling: A review. Expert Syst. Appl. 190: 116180 (2022) - [j33]Nádia Junqueira Martarelli, Marcelo Seido Nagano:
How to undertake reviews of large collections of articles and establish main contributions: an ontology-based literature review approach. Int. J. Inf. Manag. Data Insights 2(2): 100091 (2022) - [j32]Isotilia Costa Melo, P. N. Alves Junior, J. S. Callefi, Tatiana Kimura Kodama, Marcelo Seido Nagano, Daisy Aparecida do Nascimento Rebelatto:
A Performance Index for Traditional Retailers Incorporating Digital Marketplace: Benchmarking Through Data Envelopment Analysis (DEA). J. Organ. Comput. Electron. Commer. 32(3-4): 196-216 (2022) - [j31]Fernando Luis Rossi, Marcelo Seido Nagano:
Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion. OR Spectr. 44(4): 1311-1346 (2022) - [j30]Levi Ribeiro de Abreu, Bruno de Athayde Prata, Allan Costa Gomes, Stéphanie Alencar Braga-Santos, Marcelo Seido Nagano:
A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm Evol. Comput. 75: 101149 (2022) - 2021
- [j29]Fernando Luis Rossi, Marcelo Seido Nagano:
Heuristics and iterated greedy algorithms for the distributed mixed no-idle flowshop with sequence-dependent setup times. Comput. Ind. Eng. 157: 107337 (2021) - [j28]Levi Ribeiro de Abreu, Roberto Fernandes Tavares Neto, Marcelo Seido Nagano:
A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization. Eng. Appl. Artif. Intell. 104: 104373 (2021) - [j27]Fernando Luis Rossi, Marcelo Seido Nagano:
Heuristics for the mixed no-idle flowshop with sequence-dependent setup times. J. Oper. Res. Soc. 72(2): 417-443 (2021) - 2020
- [j26]Marcelo Seido Nagano, João Vítor Silva Robazzi, Caio Paziani Tomazella:
An improved lower bound for the blocking permutation flow shop with total completion time criterion. Comput. Ind. Eng. 146: 106511 (2020) - [j25]Gustavo Alencar Rolim, Marcelo Seido Nagano:
Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review. Comput. Ind. Eng. 149: 106803 (2020) - [j24]Caio Paziani Tomazella, Marcelo Seido Nagano:
A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem. Expert Syst. Appl. 158: 113556 (2020) - [j23]Anderson Rogério Faia Pinto, Marcelo Seido Nagano:
Genetic algorithms applied to integration and optimization of billing and picking processes. J. Intell. Manuf. 31(3): 641-659 (2020) - [j22]Nádia Junqueira Martarelli, Marcelo Seido Nagano:
Unsupervised feature selection based on bio-inspired approaches. Swarm Evol. Comput. 52 (2020) - [j21]Fernando Luis Rossi, Marcelo Seido Nagano:
Heuristics and metaheuristics for the mixed no-idle flowshop with sequence-dependent setup times and total tardiness minimisation. Swarm Evol. Comput. 55: 100689 (2020) - [c7]João Vítor Silva Robazzi, Marcelo Seido Nagano, Mauricio Iwama Takano:
A Branch-and-Bound Method to Minimize the Total Flow Time in a Permutation Flow Shop with Blocking and Setup Times. ICPR-Americas (1) 2020: 217-232
2010 – 2019
- 2019
- [j20]Hugo Hissashi Miyata, Marcelo Seido Nagano, Jatinder N. D. Gupta:
Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Comput. Ind. Eng. 135: 79-104 (2019) - [j19]Fernando Luis Rossi, Marcelo Seido Nagano:
Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion. Expert Syst. Appl. 125: 40-54 (2019) - [j18]Hugo Hissashi Miyata, Marcelo Seido Nagano:
The blocking flow shop scheduling problem: A comprehensive and conceptual review. Expert Syst. Appl. 137: 130-156 (2019) - [j17]Marcelo Seido Nagano, Antonio Iacono:
Knowledge Management in Eco-Innovation Practice: An Analysis of the Contribution of Eco-Innovation Tools in the Early Stages of the Product Development Process. J. Inf. Knowl. Manag. 18(4): 1950047:1-1950047:17 (2019) - [j16]Marcelo Seido Nagano, Adriano Seiko Komesu, Hugo Hissashi Miyata:
An evolutionary clustering search for the total tardiness blocking flow shop problem. J. Intell. Manuf. 30(4): 1843-1857 (2019) - [j15]Roberto Fernandes Tavares Neto, Marcelo Seido Nagano:
An Iterated Greedy approach to integrate production by multiple parallel machines and distribution by a single capacitated vehicle. Swarm Evol. Comput. 44: 612-621 (2019) - [c6]Nádia Junqueira Martarelli, Marcelo Seido Nagano:
Optimization of the Numeric and Categorical Attribute Weights in KAMILA Mixed Data Clustering Algorithm. IDEAL (1) 2019: 20-27 - 2018
- [j14]Thais Elaine Vick, Marcelo Seido Nagano:
Preconditions for Successful Knowledge Creation in the Context of Academic Innovation Projects. J. Inf. Knowl. Manag. 17(1): 1850004:1-1850004:22 (2018) - [j13]Anderson Rogério Faia Pinto, Antonio Fernando Crepaldi, Marcelo Seido Nagano:
A Genetic Algorithm applied to pick sequencing for billing. J. Intell. Manuf. 29(2): 405-422 (2018) - [j12]Nádia Junqueira Martarelli, Marcelo Seido Nagano:
A constructive evolutionary approach for feature selection in unsupervised learning. Swarm Evol. Comput. 42: 125-137 (2018) - 2017
- [j11]Juliana Keiko Sagawa, Marcelo Seido Nagano, Mauro Speranza Neto:
A closed-loop model of a multi-station and multi-product manufacturing system using bond graphs and hybrid controllers. Eur. J. Oper. Res. 258(2): 677-691 (2017) - [j10]Marcelo Seido Nagano, Fernando Luis Rossi, Caio Paziani Tomazella:
A new efficient heuristic method for minimizing the total tardiness in a no-idle permutation flow shop. Prod. Eng. 11(4-5): 523-529 (2017) - 2016
- [j9]Giovana Escrivão, Marcelo Seido Nagano:
Linking Knowledge Creation and Environmental Education. J. Inf. Knowl. Manag. 15(2): 1650017:1-1650017:23 (2016) - 2015
- [j8]Juliana Keiko Sagawa, Marcelo Seido Nagano:
Modeling the dynamics of a multi-product manufacturing system: A real case application. Eur. J. Oper. Res. 244(2): 624-636 (2015) - [j7]Thais Elaine Vick, Marcelo Seido Nagano, Silvio Popadiuk:
Information culture and its influences in knowledge creation: Evidence from university teams engaged in collaborative innovation projects. Int. J. Inf. Manag. 35(3): 292-298 (2015) - 2014
- [j6]Marcelo Seido Nagano, Augusto Almeida da Silva, Luiz Antonio Nogueira Lorena:
An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times. Expert Syst. Appl. 41(8): 3628-3633 (2014) - 2013
- [c5]Thais Elaine Vick, Marcelo Seido Nagano:
Relations between Information Literacy and Knowledge Generation in Innovation Teams - A Four Dimensional Perspective. KDIR/KMIS 2013: 437-442 - [c4]Juliana Keiko Sagawa, Marcelo Seido Nagano:
Dynamic Models for Production Control and Scheduling: A Brief Review. MICAI (Special Sessions) 2013: 38-44 - 2012
- [j5]Marcelo Seido Nagano, Augusto Almeida da Silva, Luiz Antonio Nogueira Lorena:
A new evolutionary clustering search for a no-wait flow shop problem with set-up times. Eng. Appl. Artif. Intell. 25(6): 1114-1120 (2012) - 2010
- [c3]Daniella Castro Araújo, Marcelo Seido Nagano:
An Effective Heuristic for the No-Wait Flowshop with Sequence-Dependent Setup Times Problem. MICAI (1) 2010: 187-196
2000 – 2009
- 2008
- [j4]Marcelo Seido Nagano, Rubén Ruiz, Luiz Antonio Nogueira Lorena:
A Constructive Genetic Algorithm for permutation flowshop scheduling. Comput. Ind. Eng. 55(1): 195-207 (2008) - [j3]Marcelo Seido Nagano, J. V. Moccellin:
Reducing mean flow time in permutation flow shop. J. Oper. Res. Soc. 59(7): 939-945 (2008) - 2007
- [c2]Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena:
Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop. Hybrid Metaheuristics 2007: 69-81 - [c1]Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena:
Hybrid Evolutionary Algorithm for Flowtime Minimisation in No-Wait Flowshop Scheduling. MICAI 2007: 1099-1109 - 2002
- [j2]Marcelo Seido Nagano, J. V. Moccellin:
A high quality solution constructive heuristic for flow shop sequencing. J. Oper. Res. Soc. 53(12): 1374-1379 (2002)
1990 – 1999
- 1998
- [j1]J. V. Moccellin, Marcelo Seido Nagano:
Evaluating the performance of tabu search procedures for flow shop sequencing. J. Oper. Res. Soc. 49(12): 1296-1302 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
