Metaheuristics for large-scale instances of the linear ordering problem (2015)
- Authors:
- USP affiliated authors: RONCONI, DEBORA PRETTI - EP ; BIRGIN, ERNESTO JULIAN GOLDBERG - IME
- Unidades: EP; IME
- DOI: 10.1016/j.eswa.2015.01.053
- Subjects: HEURÍSTICA; OTIMIZAÇÃO COMBINATÓRIA; COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Publisher place: Kidlington
- Date published: 2015
- Source:
- Título do periódico: Expert Systems with Applications
- ISSN: 0957-4174
- Volume/Número/Paginação/Ano: v. 42, n. 9, p. 4432-4442, 2015
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
SAKURABA, Celso Satoshi et al. Metaheuristics for large-scale instances of the linear ordering problem. Expert Systems with Applications, v. 42, n. 9, p. 4432-4442, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2015.01.053. Acesso em: 24 abr. 2024. -
APA
Sakuraba, C. S., Ronconi, D. P., Birgin, E. J. G., & Yagiura, M. (2015). Metaheuristics for large-scale instances of the linear ordering problem. Expert Systems with Applications, 42( 9), 4432-4442. doi:10.1016/j.eswa.2015.01.053 -
NLM
Sakuraba CS, Ronconi DP, Birgin EJG, Yagiura M. Metaheuristics for large-scale instances of the linear ordering problem [Internet]. Expert Systems with Applications. 2015 ; 42( 9): 4432-4442.[citado 2024 abr. 24 ] Available from: https://doi.org/10.1016/j.eswa.2015.01.053 -
Vancouver
Sakuraba CS, Ronconi DP, Birgin EJG, Yagiura M. Metaheuristics for large-scale instances of the linear ordering problem [Internet]. Expert Systems with Applications. 2015 ; 42( 9): 4432-4442.[citado 2024 abr. 24 ] Available from: https://doi.org/10.1016/j.eswa.2015.01.053 - 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
- 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
- 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.eswa.2015.01.053 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
