Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Libor Bukata"'
Publikováno v:
Computers & Operations Research. 102:52-66
Nowadays, robotic cells are mostly designed with the main goal to meet the desired production rate without any consideration of the energy efficiency, therefore, it is often possible to achieve significant energy savings without downsizing the produc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::caf20ae6f3566dc6d9fabf22b9b838b8
https://doi.org/10.1016/j.cor.2018.09.012
https://doi.org/10.1016/j.cor.2018.09.012
Publikováno v:
Journal of Parallel and Distributed Computing. 77:58-68
In the paper, a parallel Tabu Search algorithm for the Resource Constrained Project Scheduling Problem is proposed. To deal with this NP-hard combinatorial problem many optimizations have been performed. For example, a resource evaluation algorithm i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f01768963b34517c870a0ebc6fc8943b
https://doi.org/10.1016/j.jpdc.2014.11.005
https://doi.org/10.1016/j.jpdc.2014.11.005
Publikováno v:
Math for the Digital Factory ISBN: 9783319639550
A novel mathematical formulation of the energy optimisation problem for robotic lines is presented, which allows minimising the energy consumption in a robotic cell while keeping the required production cycle time. Different energy saving modes of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::540d45b0e799296ace9db8dbc7add42b
https://doi.org/10.1007/978-3-319-63957-4_7
https://doi.org/10.1007/978-3-319-63957-4_7
Autor:
Premysl Sucha, Libor Bukata
Publikováno v:
PDP
This work proposes a GPU algorithm for a combinatorial problem known in literature as Resource Constrained Project Scheduling Problem. To solve this NP-hard problem, Tabu Search meta-heuristic is selected. All computations are performed on the GPU to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cc59bed77680873ba66679aff45251d
https://doi.org/10.1109/pdp.2013.59
https://doi.org/10.1109/pdp.2013.59