A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem (2020)
- Authors:
- USP affiliated authors: NAGANO, MARCELO SEIDO - EESC ; TOMAZELLA, CAIO PAZIANI - ICMC
- Unidades: EESC; ICMC
- DOI: 10.1016/j.eswa.2020.113556
- Subjects: ENGENHARIA DE PRODUÇÃO; PROGRAMAÇÃO DA PRODUÇÃO; ALGORITMOS
- Language: Inglês
- Imprenta:
- Publisher place: Kidlington, United Kingdon
- Date published: 2020
- Source:
- Título: Expert Systems with Applications
- ISSN: 0957-4174
- Volume/Número/Paginação/Ano: v. 158, article 113556, p. 1-19, Nov. 2020
- Status:
- Artigo possui versão em acesso aberto em repositório (Green Open Access)
- Versão do Documento:
- Versão submetida (Pré-print)
- Acessar versão aberta:
-
ABNT
TOMAZELLA, Caio Paziani e NAGANO, Marcelo Seido. A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem. Expert Systems with Applications, v. No 2020, p. 1-19, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2020.113556. Acesso em: 10 abr. 2026. -
APA
Tomazella, C. P., & Nagano, M. S. (2020). A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem. Expert Systems with Applications, No 2020, 1-19. doi:10.1016/j.eswa.2020.113556 -
NLM
Tomazella CP, Nagano MS. A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem [Internet]. Expert Systems with Applications. 2020 ; No 2020 1-19.[citado 2026 abr. 10 ] Available from: https://doi.org/10.1016/j.eswa.2020.113556 -
Vancouver
Tomazella CP, Nagano MS. A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem [Internet]. Expert Systems with Applications. 2020 ; No 2020 1-19.[citado 2026 abr. 10 ] Available from: https://doi.org/10.1016/j.eswa.2020.113556 - An improved lower bound for the blocking permutation flow shop with total completion time criterion
- A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop
- On the integration of reinforcement learning and simulated annealing for the parallel batch scheduling problem with setups
- Modeling Approaches and Solution Methods for the Lot-Sizing and Raw Material Procurement Problem
- Novos limitantes inferiores para o método branch-and-bound na solução de problemas flowshop permutacional
- Service-level-driven procurement and production lot-sizing problem with demand fulfilment
- Inventory perishability in the stochastic flexible production and procurement lot-sizing problem
- Addressing the multistage integrated procurement and lot-sizing problem with demand fulfillment, backlogging and service levels
- MIP-heuristics for the integrated lot-sizing and supplier selection problem with perishability
- A mixed integer model for the integrated lot-sizing and raw material procurement problem with quantity discounts and age-based holding costs
Informações sobre a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
Por se tratar de integração com serviço externo, podem existir diferentes versões do trabalho (como preprints ou postprints), que podem diferir da versão publicada.
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
1-s2.0-S0957417420303808-... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
