Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem (2020)
- Authors:
- USP affiliated authors: BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; RONCONI, DEBORA PRETTI - EP
- Unidades: IME; EP
- DOI: 10.1016/j.cor.2020.105020
- Subjects: ALGORITMOS DE SCHEDULING; HEURÍSTICA
- Keywords: Flexible job shop scheduling with sequence; flexibility; Resumable operations; Unavailability of the machines; Sequence-dependent setup time; Mixed integer linear programming; Constraint programming
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Computers & Operations Research
- ISSN: 0305-0548
- Volume/Número/Paginação/Ano: v. 123, p. 1-20, 2020
- Status:
- Artigo possui versão em acesso aberto em repositório (Green Open Access)
- Versão do Documento:
- Versão submetida (Pré-print)
- Acessar versão aberta:
-
ABNT
LUNARDI, Willian Tessaro et al. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, v. 123, p. 1-20, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2020.105020. Acesso em: 02 abr. 2026. -
APA
Lunardi, W. T., Birgin, E. J. G., Laborie, P., Ronconi, D. P., & Voos, H. (2020). Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem. Computers & Operations Research, 123, 1-20. doi:10.1016/j.cor.2020.105020 -
NLM
Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.[citado 2026 abr. 02 ] Available from: https://doi.org/10.1016/j.cor.2020.105020 -
Vancouver
Lunardi WT, Birgin EJG, Laborie P, Ronconi DP, Voos H. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem [Internet]. Computers & Operations Research. 2020 ; 123 1-20.[citado 2026 abr. 02 ] Available from: https://doi.org/10.1016/j.cor.2020.105020 - 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
- Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness
- A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers
- 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
- Metaheuristics for large-scale instances of the linear ordering problem
- Metaheuristics for the online printing shop scheduling problem
Informações sobre a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
Por se tratar de integração com serviço externo, podem existir diferentes versões do trabalho (como preprints ou postprints), que podem diferir da versão publicada.
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3000455.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
