A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop (2017)
- Authors:
- USP affiliated authors: NAGANO, MARCELO SEIDO - EESC ; ROSSI, FERNANDO LUÍS - EESC ; TOMAZELLA, CAIO PAZIANI - EESC
- Unidade: EESC
- Sigla do Departamento: SEP
- DOI: 10.1007/s11740-017-0747-2
- Subjects: SCHEDULING; HEURÍSTICA; PROGRAMAÇÃO DA PRODUÇÃO
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: Springer
- Publisher place: Heidelberg
- Date published: 2017
- Source:
- Título: Production Engineering: research and development
- ISSN: 0944-6524
- Volume/Número/Paginação/Ano: n. 11, p. 523-529, 2017
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
NAGANO, Marcelo Seido e ROSSI, Fernando Luis e TOMAZELLA, Caio Paziani. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop. Production Engineering: research and development, n. 11, p. 523-529, 2017Tradução . . Disponível em: https://doi.org/10.1007/s11740-017-0747-2. Acesso em: 30 dez. 2025. -
APA
Nagano, M. S., Rossi, F. L., & Tomazella, C. P. (2017). A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop. Production Engineering: research and development, ( 11), 523-529. doi:10.1007/s11740-017-0747-2 -
NLM
Nagano MS, Rossi FL, Tomazella CP. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop [Internet]. Production Engineering: research and development. 2017 ;( 11): 523-529.[citado 2025 dez. 30 ] Available from: https://doi.org/10.1007/s11740-017-0747-2 -
Vancouver
Nagano MS, Rossi FL, Tomazella CP. A new efcient heuristic method for minimizing the total tardiness in a no-idle permutation fow shop [Internet]. Production Engineering: research and development. 2017 ;( 11): 523-529.[citado 2025 dez. 30 ] Available from: https://doi.org/10.1007/s11740-017-0747-2 - An effective constructive heuristic for permutation flow shop scheduling problem with total flow time criterion
- A comprehensive review of Branch-and-Bound algorithms: guidelines and directions for further research on the flowshop scheduling problem
- An improved lower bound for the blocking permutation flow shop with total completion time criterion
- Modeling Approaches and Solution Methods for the Lot-Sizing and Raw Material Procurement Problem
- Métodos heurísticos para minimização da duração total da programação e do tempo total de fluxo em ambientes flow shop permutacional
- 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 contribution for the mixed no-idle flowshop scheduling problem with sequence-dependent setup times: analysis and solutions procedures
- 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
Informações sobre o DOI: 10.1007/s11740-017-0747-2 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
PROD_23957_SYSNO_3041387 ... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
