Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Přemysl Šůcha"'
Publikováno v:
European Journal of Operational Research. 308:990-1006
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1ae8f28810c9e8fcc979ca4a8c6c94c
https://doi.org/10.1016/j.ejor.2022.11.034
https://doi.org/10.1016/j.ejor.2022.11.034
Publikováno v:
European Journal of Operational Research. 298:413-424
This paper addresses a single machine scheduling problem minimizing the weighted number of tardy jobs, where each job is characterized by processing time, due date, deadline, and weight. It is known from the existing literature that so-called strongl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e57eefaae17e349333ec56dc683bdd45
https://doi.org/10.1016/j.ejor.2021.07.002
https://doi.org/10.1016/j.ejor.2021.07.002
Publikováno v:
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
In this paper, we study a multi-agent project staffing problem involving a single project, which has to be scheduled under resource constraints. We consider a functional organisational structure where a team leader and a project manager are together
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f0244700be733c603f56244c982e9ac
https://doi.org/10.1016/j.ejor.2021.03.028
https://doi.org/10.1016/j.ejor.2021.03.028
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, 2021, 294 (1), pp.29-41. ⟨10.1016/j.ejor.2021.01.023⟩
European Journal of Operational Research, 2021, 294 (1), pp.29-41. ⟨10.1016/j.ejor.2021.01.023⟩
This paper addresses a project scheduling environment in which the activities are partitioned among a set of agents. The project owner is interested in completing the project as soon as possible. Therefore, she/he defines rewards and penalties to sti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::befb7136f2c369c91c001fa132d8f03b
https://hal.science/hal-03539307
https://hal.science/hal-03539307
Autor:
Luca Benini, Přemysl Šůcha, Andrea Marongiu, Michał Sójka, Björn Forsberg, Zdeněk Hanzálek, Joel Matějka
Publikováno v:
Parallel Computing
Many applications require both high performance and predictable timing. High-performance can be provided by COTS Multi-Core System on Chips (MPSoC), however, as cores in these systems share main memory, they are susceptible to interference from each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b23548b44749d6633f4f1108fe7f7c6
https://doi.org/10.1016/j.parco.2018.11.002
https://doi.org/10.1016/j.parco.2018.11.002
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:
Annals of Operations Research
Annals of Operations Research, Springer Verlag, 2020, 285 (1-2), pp.97-119. ⟨10.1007/s10479-019-03235-w⟩
Annals of Operations Research, 2020, 285 (1-2), pp.97-119. ⟨10.1007/s10479-019-03235-w⟩
Annals of Operations Research, Springer Verlag, 2020, 285 (1-2), pp.97-119. ⟨10.1007/s10479-019-03235-w⟩
Annals of Operations Research, 2020, 285 (1-2), pp.97-119. ⟨10.1007/s10479-019-03235-w⟩
International audience; We consider a project scheduling environment in which the activities are partitioned among a set of agents. The owner of each activity can decide its length, which is linearly related to its cost within a minimum (crash) and a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf44df01bb9f74f1bcdb23a655e3de45
https://hal.laas.fr/hal-03009331
https://hal.laas.fr/hal-03009331
Publikováno v:
European Journal of Operational Research. 271:1055-1069
This study presents a widely applicable approach to accelerate the computation time of the Branch-and-Price (BaP) algorithm, which is a very powerful exact method used for solving complex combinatorial problems. Existing studies indicate that the mos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fa59eca47444a784b3e3ea6f43810a5
https://doi.org/10.1016/j.ejor.2018.05.046
https://doi.org/10.1016/j.ejor.2018.05.046
Publikováno v:
Journal of Scheduling. 20:475-491
Cooperative projects involve a set of self-interested contractors, each in charge of a part of the project. Each contractor may control the duration of his activities, which can be shorten up to an incompressible limit, by gathering extra resources a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d0861e7a605c6e4aa5dc97bc18b9523
https://doi.org/10.1007/s10951-017-0516-2
https://doi.org/10.1007/s10951-017-0516-2
Publikováno v:
Computers & Operations Research. 76:95-117
An acceptable response time of a server is an important aspect in many client–server applications; this is evident in situations in which the server is overloaded by many computationally intensive requests. In this work, we consider that the reques
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68c6459d12864d77b741e14a18220ebf
https://doi.org/10.1016/j.cor.2016.06.008
https://doi.org/10.1016/j.cor.2016.06.008