An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (2020)
- Authors:
- USP affiliated authors: NAGANO, MARCELO SEIDO - EESC ; ALMEIDA, FERNANDO SIQUEIRA DE - EESC ; MIYATA, HUGO HISSASHI - EESC
- Unidade: EESC
- DOI: 10.1080/0305215X.2020.1797000
- Subjects: ALGORITMOS; PROGRAMAÇÃO DA PRODUÇÃO; ENGENHARIA DE PRODUÇÃO
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Oxfordshire, United Kingdom
- Date published: 2020
- Source:
- Título: Engineering Optimization
- ISSN: 0305-215X
- Volume/Número/Paginação/Ano: article 1797000, p. [1-20], 2020
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
NAGANO, Marcelo Seido e ALMEIDA, Fernando Siqueira de e MIYATA, Hugo Hissashi. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, p. [1-20], 2020Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2020.1797000. Acesso em: 09 nov. 2024. -
APA
Nagano, M. S., Almeida, F. S. de, & Miyata, H. H. (2020). An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time. Engineering Optimization, [1-20]. doi:10.1080/0305215X.2020.1797000 -
NLM
Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2024 nov. 09 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000 -
Vancouver
Nagano MS, Almeida FS de, Miyata HH. An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time [Internet]. Engineering Optimization. 2020 ; [1-20].[citado 2024 nov. 09 ] Available from: https://doi.org/10.1080/0305215X.2020.1797000 - Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times
- Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times
- Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization
- 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
- An evolutionary clustering search for the total tardiness blocking flow shop problem
- Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function
- An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan
- The blocking flow shop scheduling problem: a comprehensive and conceptual review
- Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
Informações sobre o DOI: 10.1080/0305215X.2020.1797000 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
10.1080@0305215X.2020.179... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
