Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Débora P. Ronconi"'
Autor:
João L. V. Manguino, Débora P. Ronconi
Publikováno v:
Annals of Operations Research. 316:1013-1038
The vehicle routing problem is a traditional combinatorial problem with practical relevance for a wide range of industries. In the literature, several specificities have been tackled by dedicated methods in order to better reflect real-world situatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a6f790a0b40e1084269c54ccdef3cca
https://doi.org/10.1007/s10479-020-03915-y
https://doi.org/10.1007/s10479-020-03915-y
Autor:
Débora P. Ronconi, João L. V. Manguino
Publikováno v:
Annals of Operations Research.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6eb037bb0bada6f83be3a1428e50742
https://doi.org/10.1007/s10479-022-04701-8
https://doi.org/10.1007/s10479-022-04701-8
Publikováno v:
Gestão & Produção, Vol 17, Iss 4, Pp 683-692 (2010)
Embora existam muitos trabalhos que tratam do problema de programação de tarefas no ambiente flowshop flexível com o objetivo de minimizar o makespan, poucos abordam este problema envolvendo datas de entrega. Com o aumento do nível de exigência
Externí odkaz:
https://doaj.org/article/ade2125b7d8f40c98d0df44378a17da1
In [E. G. Birgin, O. C. Rom\~ao, and D. P. Ronconi, The multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers, International Transactions in Operational Research 27(3), 1392-1418, 2020] the multi-period two-dimension
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a11f2caf7cde8112b2e0229ce1a40be2
http://arxiv.org/abs/2107.11901
http://arxiv.org/abs/2107.11901
Publikováno v:
Gestão & Produção, Vol 7, Iss 3, Pp 352-363 (2000)
Trabalhos na área de programação de tarefas mostram que atender a data de entrega dos consumidores é uma preocupação crítica na maioria dos sistemas de manufatura. Enquanto existe considerável pesquisa para minimizar o makespan para o problem
Externí odkaz:
https://doaj.org/article/dc4dc583872343d5aebbb76c412992b3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030876715
ICCL
ICCL
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a2881119cc48c074bdc84973eb926f3
https://doi.org/10.1007/978-3-030-87672-2_31
https://doi.org/10.1007/978-3-030-87672-2_31
Autor:
Marco Aurélio de Mesquita, Rafael Gardel Azzariti Brasil, Tiago Montanher, Dario Ikuo Miyake, Débora P. Ronconi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030876715
ICCL
ICCL
This paper addresses the scheduling of offshore oil well construction using drilling vessels. Drilling costs constitute a substantial part of the total development costs for an offshore field, thus planning the efficient use of drilling rigs is cruci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66c5fbbffc3e79d9ebdc9bf919f88306
https://doi.org/10.1007/978-3-030-87672-2_5
https://doi.org/10.1007/978-3-030-87672-2_5
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Programming Models for the Online Printing Shop Scheduling Problem, Computers & Operations Research, to appear) i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::faad5d1de206c79a6a14a14c872869e2
http://orbilu.uni.lu/handle/10993/43895
http://orbilu.uni.lu/handle/10993/43895
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
In this work, the online printing shop scheduling problem is considered. This challenging real problem, that appears in the nowadays printing industry, can be seen as a flexible job shop scheduling problem with sequence flexibility in which precedenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88664b1c2a133eefcb949e994ee5e910
http://arxiv.org/abs/2006.13064
http://arxiv.org/abs/2006.13064
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b660c83398965d30dd33c4dcb558827