Metaheuristics for the online printing shop scheduling problem (2021)
- Authors:
- USP affiliated authors: BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; RONCONI, DEBORA PRETTI - EP
- Unidades: IME; EP
- DOI: 10.1016/j.ejor.2020.12.021
- Subjects: PROGRAMAÇÃO MATEMÁTICA; SCHEDULING
- Keywords: Metaheuristics; Local search; Flexible job shop scheduling; Sequencing flexibility; Online printing shop scheduling
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: European Journal of Operational Research
- ISSN: 0377-2217
- Volume/Número/Paginação/Ano: v. 293, n. 2, p. 419-441, 2021
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
LUNARDI, Willian Tessaro et al. Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, v. 293, n. 2, p. 419-441, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.021. Acesso em: 23 maio 2024. -
APA
Lunardi, W. T., Birgin, E. J. G., Ronconi, D. P., & Voos, H. (2021). Metaheuristics for the online printing shop scheduling problem. European Journal of Operational Research, 293( 2), 419-441. doi:10.1016/j.ejor.2020.12.021 -
NLM
Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 maio 23 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021 -
Vancouver
Lunardi WT, Birgin EJG, Ronconi DP, Voos H. Metaheuristics for the online printing shop scheduling problem [Internet]. European Journal of Operational Research. 2021 ; 293( 2): 419-441.[citado 2024 maio 23 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.021 - 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
- 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
- Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem
- Um algoritmo do tipo list scheduling para o problema flowshop minimizando o adiantamento e atraso das tarefas
- MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
- 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
Informações sobre o DOI: 10.1016/j.ejor.2020.12.021 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 3020438.pdf | ||
 | 3020438.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
