An improved lower bound for the blocking permutation flow shop with total completion time criterion (2020)
- Authors:
- USP affiliated authors: NAGANO, MARCELO SEIDO - EESC ; TOMAZELLA, CAIO PAZIANI - ICMC
- Unidades: EESC; ICMC
- DOI: 10.1016/j.cie.2020.106511
- Subjects: PROGRAMAÇÃO MATEMÁTICA; ENGENHARIA DE PRODUÇÃO
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Kidlington, United Kingdom
- Date published: 2020
- Source:
- Título: Computers & Industrial Engineering
- ISSN: 0360-8352
- Volume/Número/Paginação/Ano: v. 146, article 106511, p. 1-5, Aug. 2020
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
NAGANO, Marcelo Seido e ROBAZZI, João Vitor Silva e TOMAZELLA, Caio Paziani. An improved lower bound for the blocking permutation flow shop with total completion time criterion. Computers & Industrial Engineering, v. 146, p. 1-5, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cie.2020.106511. Acesso em: 29 dez. 2025. -
APA
Nagano, M. S., Robazzi, J. V. S., & Tomazella, C. P. (2020). An improved lower bound for the blocking permutation flow shop with total completion time criterion. Computers & Industrial Engineering, 146, 1-5. doi:10.1016/j.cie.2020.106511 -
NLM
Nagano MS, Robazzi JVS, Tomazella CP. An improved lower bound for the blocking permutation flow shop with total completion time criterion [Internet]. Computers & Industrial Engineering. 2020 ; 146 1-5.[citado 2025 dez. 29 ] Available from: https://doi.org/10.1016/j.cie.2020.106511 -
Vancouver
Nagano MS, Robazzi JVS, Tomazella CP. An improved lower bound for the blocking permutation flow shop with total completion time criterion [Internet]. Computers & Industrial Engineering. 2020 ; 146 1-5.[citado 2025 dez. 29 ] Available from: https://doi.org/10.1016/j.cie.2020.106511 - A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem
- Modeling Approaches and Solution Methods for the Lot-Sizing and Raw Material Procurement Problem
- 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
- Novos limitantes inferiores para o método branch-and-bound na solução de problemas flowshop permutacional
- A mixed integer model for the integrated lot-sizing and raw material procurement problem with quantity discounts and age-based holding costs
- Service-level-driven procurement and production lot-sizing problem with demand fulfilment
- 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
- Direcionadores de valor para instituições financeiras no Brasil: um estudo preliminar
Informações sobre o DOI: 10.1016/j.cie.2020.106511 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
1-s2.0-S036083522030245X-... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
