An evolutionary clustering search for the total tardiness blocking flow shop problem (2019)
- Authors:
- USP affiliated authors: NAGANO, MARCELO SEIDO - EESC ; MIYATA, HUGO HISSASHI - EESC
- Unidade: EESC
- Sigla do Departamento: SEP
- DOI: 10.1007/s10845-017-1358-7
- Subjects: COMPRA E VENDA; GESTÃO DE NEGÓCIOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: Springer New York LLC
- Publisher place: New York
- Date published: 2019
- Source:
- Título: Journal of Intelligent Manufacturing
- ISSN: 0956-5515
- Volume/Número/Paginação/Ano: v. 30, p. 1843–1857, 2019
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
NAGANO, Marcelo Seido e KOMESU, Adriano Seiko e MIYATA, Hugo Hissashi. An evolutionary clustering search for the total tardiness blocking flow shop problem. Journal of Intelligent Manufacturing, v. 30, p. 1843–1857, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10845-017-1358-7. Acesso em: 01 jan. 2026. -
APA
Nagano, M. S., Komesu, A. S., & Miyata, H. H. (2019). An evolutionary clustering search for the total tardiness blocking flow shop problem. Journal of Intelligent Manufacturing, 30, 1843–1857. doi:10.1007/s10845-017-1358-7 -
NLM
Nagano MS, Komesu AS, Miyata HH. An evolutionary clustering search for the total tardiness blocking flow shop problem [Internet]. Journal of Intelligent Manufacturing. 2019 ; 30 1843–1857.[citado 2026 jan. 01 ] Available from: https://doi.org/10.1007/s10845-017-1358-7 -
Vancouver
Nagano MS, Komesu AS, Miyata HH. An evolutionary clustering search for the total tardiness blocking flow shop problem [Internet]. Journal of Intelligent Manufacturing. 2019 ; 30 1843–1857.[citado 2026 jan. 01 ] Available from: https://doi.org/10.1007/s10845-017-1358-7 - Optimizing distributed no-wait flow shop scheduling problem with setup times and maintenance operations via iterated greedy algorithm
- Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance
- Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization
- Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times
- Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
- The blocking flow shop scheduling problem: a comprehensive and conceptual review
- An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan
- Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function
- Procedure structuring for programming aircraft maintenance activities
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time
Informações sobre o DOI: 10.1007/s10845-017-1358-7 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
PROD_24488_SYSNO_3042624.... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
