Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Mayron César O. Moreira"'
Publikováno v:
International Journal of Production Research. 60:2193-2211
This paper proposes new algorithms for the assembly line balancing problem with hierarchical worker assignment (ALBHW). The ALBHW appears in real industrial contexts, where companies deal with a mu...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f19085b605aea2446f7924ed2dad924
https://doi.org/10.1080/00207543.2021.1884767
https://doi.org/10.1080/00207543.2021.1884767
Mathematical models and heuristic algorithms for pallet building problems with practical constraints
Publikováno v:
Annals of Operations Research.
In the pallet building problem, we aim at loading a given set of items into one or more pallets, by satisfying specific constraints and minimizing the number of pallets used. In this paper, we address a practical case of this problem that originates
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85abf0d35a9eccda321d58da7f09bef3
https://doi.org/10.1007/s10479-021-04349-w
https://doi.org/10.1007/s10479-021-04349-w
Publikováno v:
CEC
The Nesting problem, or the irregular cutting and packing problem, aims to find the best position of irregular pieces within a board, minimizing the space used by them. The problem’s relevance is that it is widely used in the furniture, textile, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9414d3d80f7497ccad993eaefaad102a
https://doi.org/10.1109/cec45853.2021.9504813
https://doi.org/10.1109/cec45853.2021.9504813
Publikováno v:
Enterprise Information Systems ISBN: 9783030754174
ICEIS (Revised Selected Papers)
ICEIS (Revised Selected Papers)
We study a pallet building problem that originates from a case study in a company that produces robotized systems for freight transportation and logistics. We generalize the problem by including the concept of family of items, which allows us to cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01bfecaba28e942846eef00116dfbf15
https://hdl.handle.net/11380/1251650
https://hdl.handle.net/11380/1251650
Publikováno v:
AIRO Springer Series ISBN: 9783030630713
In this paper, we propose a combined algorithm based on an Iterated Local Search (ILS) and a mathematical model to solve the Time Window Assignment Vehicle Routing Problem (TWAVRP). The TWAVRP appears when the volume of customer demands is uncertain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1fe9c1f0aa1e1965bbb85902c77d0265
https://doi.org/10.1007/978-3-030-63072-0_18
https://doi.org/10.1007/978-3-030-63072-0_18
In this paper, we study a new Workforce Scheduling and Routing Problem, denoted Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks. In this problem, customers request services from a company. Each service is composed of depende
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7170b9eb1a1957a5ff548d2713e87488
http://arxiv.org/abs/2008.02849
http://arxiv.org/abs/2008.02849
Publikováno v:
CEC
Redistricting problems arise when due to evolving attributes, current districts get increasingly inefficient or even infeasible. A typical example are electoral districts of roughly the same population, which after changes in its distribution, become
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4843b1c11816f957ce9c7882c0c484c4
https://doi.org/10.1109/cec48606.2020.9185552
https://doi.org/10.1109/cec48606.2020.9185552
Publikováno v:
CEC
In this paper we consider districting problems with routing criteria. Such problems arise when clients in a commercial district need to be attended daily and the time to visit them is limited, for example by working hours of retail businesses. Routin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::895e956e2afdd0db1450e1cd3d9e988d
https://doi.org/10.1109/cec48606.2020.9185863
https://doi.org/10.1109/cec48606.2020.9185863
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030597467
ICCL
ICCL
In this paper, we study a pallet building problem that originates from a case study in a company that produces robotized systems for freight transportation and logistics. The problem takes into account well-known constraints, such as rotation and sta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1af5e01d07f43335bdffcab536bdcae8
https://doi.org/10.1007/978-3-030-59747-4_42
https://doi.org/10.1007/978-3-030-59747-4_42
Publikováno v:
ICEIS (1)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6354b7ec710ac71eb738520e9fc23c82
https://doi.org/10.5220/0009351703270338
https://doi.org/10.5220/0009351703270338