A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (2020)
- Authors:
- USP affiliated authors: BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; RONCONI, DEBORA PRETTI - EP
- Unidades: IME; EP
- DOI: 10.1016/j.cor.2019.104824
- Subjects: ALGORITMOS DE SCHEDULING; HEURÍSTICA; PROGRAMAÇÃO DA PRODUÇÃO
- Keywords: Scheduling; Flowshop; Earliness and tardiness; Common due date; Waiting time; Heuristics; Beam search
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Computers & Operations Research
- ISSN: 0305-0548
- Volume/Número/Paginação/Ano: v. 114, n. 1-14, p.104824, 2020
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
BIRGIN, Ernesto Julian Goldberg e JESUS FILHO, José Eurípedes Ferreira de e RONCONI, Débora Pretti. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, v. 114, n. 1-14, p. 104824, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2019.104824. Acesso em: 23 abr. 2024. -
APA
Birgin, E. J. G., Jesus Filho, J. E. F. de, & Ronconi, D. P. (2020). A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs. Computers & Operations Research, 114( 1-14), 104824. doi:10.1016/j.cor.2019.104824 -
NLM
Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.cor.2019.104824 -
Vancouver
Birgin EJG, Jesus Filho JEF de, Ronconi DP. A filtered beam search method for the m-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs [Internet]. Computers & Operations Research. 2020 ; 114( 1-14): 104824.[citado 2024 abr. 23 ] Available from: https://doi.org/10.1016/j.cor.2019.104824 - A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers
- Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness
- Metaheuristics for the online printing shop scheduling problem
- Heuristic methods for the single machine scheduling problem with different ready times and a common due date
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Optimizing the packing of cylinders into a rectangular container: a nonlinear approach
- Metaheuristics for large-scale instances of the linear ordering problem
- Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas
- Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem
- MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
Informações sobre o DOI: 10.1016/j.cor.2019.104824 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2970508.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
