Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Tal Raviv"'
Publikováno v:
Mathematics, Vol 11, Iss 23, p 4784 (2023)
This paper presents a method for unsupervised classification of entities by a group of agents with unknown domains and levels of expertise. In contrast to the existing methods based on majority voting (“wisdom of the crowd”) and their extensions
Externí odkaz:
https://doaj.org/article/de2f8138f06e44549c614067a1d99f39
Autor:
Edison Avraham, Tal Raviv
Publikováno v:
EURO Journal on Transportation and Logistics, Vol 12, Iss , Pp 100112- (2023)
In this paper, we study an extension of the orienteering problem where travel times are random and time-dependent and service times are random. Additionally, the service at each selected customer is subject to a soft time window; that is, violation o
Externí odkaz:
https://doaj.org/article/bd82af84f1d24509942fe9fcc4602808
Publikováno v:
Acta Dermato-Venereologica, Vol 100, Iss 17, p adv00286 (2020)
Rituximab targets the B-lymphocyte antigen CD20, providing pemphigus vulgaris patients with long-term remissions. However, the effects of repeated courses have not yet been established. This study aimed to evaluate the effect of repeated rituximab co
Externí odkaz:
https://doaj.org/article/be4159bf1aea451bbeb299837d15590b
Publikováno v:
European Journal of Operational Research. 299:945-959
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b52509560c989d12c8ca8c501396ff3b
https://doi.org/10.1016/j.ejor.2021.12.043
https://doi.org/10.1016/j.ejor.2021.12.043
Publikováno v:
Networks. 79:253-263
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ca37dedb68bbc4e105c4c10747903e3
https://doi.org/10.1002/net.22092
https://doi.org/10.1002/net.22092
Publikováno v:
Transportation Science, 57(2), 424-443. INFORMS Institute for Operations Research and the Management Sciences
Puzzle-based storage (PBS) systems store unit loads at very high density, without consuming space for transport aisles. In such systems, each load is stored on a moving device (conveyor module or transport vehicle), making these systems very expensiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a408e101c0adf1503aba4ffa4ec658aa
https://pure.eur.nl/en/publications/248d2083-9828-4a0a-a83a-91c4c661b5e0
https://pure.eur.nl/en/publications/248d2083-9828-4a0a-a83a-91c4c661b5e0
Autor:
Edison Avraham, Tal Raviv
Publikováno v:
Transportation Research Part B: Methodological. 154:266-288
We present a model for policy optimization of the online booking of mobile personnel over a multiday horizon with a different cutoff for each day, where the goal is to maximize the expected ratio of accepted requests at steady-state. This model fits
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4b4e9266b41a9a6e99be2fbfeddcee1
https://doi.org/10.1016/j.trb.2021.10.008
https://doi.org/10.1016/j.trb.2021.10.008
Autor:
Michal Penn, Tal Raviv
Publikováno v:
Journal of Scheduling. 24:83-102
Following a recent interest in sustainable scheduling under operational costs that vary over time, we study scheduling problems on a single machine under time-of-use electricity tariffs. We consider two main variants of the problem: cost minimization
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66df3aea128fd4343387915f8ce9800a
https://doi.org/10.1007/s10951-020-00674-3
https://doi.org/10.1007/s10951-020-00674-3
Publikováno v:
European Journal of Operational Research. 284:427-438
We study a variant of the multiprocessor job scheduling problem, where jobs are processed by several identical machines. The machines are ordered in a sequence, and each job is processed by several consecutive machines simultaneously. The jobs are ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7568a1de318cca15e06f56357d8dcc88
https://doi.org/10.1016/j.ejor.2019.12.043
https://doi.org/10.1016/j.ejor.2019.12.043
Publikováno v:
TOP. 29:372-386
The test collection problem, also known as the minimum test set problem or the minimum test cover problem, selects a minimal set of binary attributes by which it is possible to determine the state of a system. This problem commonly arises in applicat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c8b2d0ab9558b4ab5c71ce1cc500130
https://doi.org/10.1007/s11750-020-00554-1
https://doi.org/10.1007/s11750-020-00554-1