Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness (2012)
- Authors:
- USP affiliated authors: RONCONI, DEBORA PRETTI - EP ; BIRGIN, ERNESTO JULIAN GOLDBERG - IME
- Unidades: EP; IME
- DOI: 10.1007/978-1-4614-1123-9_5
- Assunto: PROGRAMAÇÃO MATEMÁTICA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Just-in-time systems
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
RONCONI, Débora Pretti e BIRGIN, Ernesto Julian Goldberg. Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness. Just-in-time systems. Tradução . New York: Springer, 2012. . Disponível em: https://doi.org/10.1007/978-1-4614-1123-9_5. Acesso em: 09 fev. 2026. -
APA
Ronconi, D. P., & Birgin, E. J. G. (2012). Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness. In Just-in-time systems. New York: Springer. doi:10.1007/978-1-4614-1123-9_5 -
NLM
Ronconi DP, Birgin EJG. Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness [Internet]. In: Just-in-time systems. New York: Springer; 2012. [citado 2026 fev. 09 ] Available from: https://doi.org/10.1007/978-1-4614-1123-9_5 -
Vancouver
Ronconi DP, Birgin EJG. Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness [Internet]. In: Just-in-time systems. New York: Springer; 2012. [citado 2026 fev. 09 ] Available from: https://doi.org/10.1007/978-1-4614-1123-9_5 - 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
- Metaheuristics for the online printing shop scheduling problem
- A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers
- Optimizing the packing of cylinders into a rectangular container: a nonlinear approach
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Heuristic methods for the single machine scheduling problem with different ready times and a common due date
- MIP models for two-dimensional non-guillotine cutting problems with usable leftovers
- Metaheuristics for large-scale instances of the linear ordering problem
- 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.1007/978-1-4614-1123-9_5 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
Ronconi-2012-mixed.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
