Heuristic methods for the single machine scheduling problem with different ready times and a common due date (2012)
- Authors:
- USP affiliated authors: BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; RONCONI, DEBORA PRETTI - EP
- Unidades: IME; EP
- DOI: 10.1080/0305215X.2011.634409
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; SCHEDULING
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Engineering Optimization
- ISSN: 0305-215X
- Volume/Número/Paginação/Ano: v. 44, n. 10, p. 1197-1208, 2012
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
BIRGIN, Ernesto Julian Goldberg e RONCONI, Débora Pretti. Heuristic methods for the single machine scheduling problem with different ready times and a common due date. Engineering Optimization, v. 44, n. 10, p. 1197-1208, 2012Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2011.634409. Acesso em: 03 maio 2024. -
APA
Birgin, E. J. G., & Ronconi, D. P. (2012). Heuristic methods for the single machine scheduling problem with different ready times and a common due date. Engineering Optimization, 44( 10), 1197-1208. doi:10.1080/0305215X.2011.634409 -
NLM
Birgin EJG, Ronconi DP. Heuristic methods for the single machine scheduling problem with different ready times and a common due date [Internet]. Engineering Optimization. 2012 ; 44( 10): 1197-1208.[citado 2024 maio 03 ] Available from: https://doi.org/10.1080/0305215X.2011.634409 -
Vancouver
Birgin EJG, Ronconi DP. Heuristic methods for the single machine scheduling problem with different ready times and a common due date [Internet]. Engineering Optimization. 2012 ; 44( 10): 1197-1208.[citado 2024 maio 03 ] Available from: https://doi.org/10.1080/0305215X.2011.634409 - A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness
- Metaheuristics for the online printing shop scheduling problem
- 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.1080/0305215X.2011.634409 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
