Get started
Author

Hagai Ilani

Observed name: Ilani, Hagai
ORCID: 0000-0003-3548-1572
Observed ORCID: 0000-0003-3548-1572
OpenAlex ID: A5041486471
Bounds on the average and minimum attendance in preference-based activity scheduling
2021 · Lior Aronshtam, Hagai Ilani · Discrete Applied Mathematics · 22
A reduction approach to the two-campus transport problem
2013 · Hagai Ilani, Elad Shufan, et al. · Journal of Scheduling · 10
The representation of partially-concurrent open shop problems
2015 · Tal Grinshpoun, Hagai Ilani, et al. · Annals of Operations Research · 8
Partially concurrent open shop scheduling with integral preemptions
2017 · Hagai Ilani, Elad Shufan, et al. · Annals of Operations Research · 6
Reentrant flow shop with identical jobs and makespan criterion
2021 · Elad Shufan, Tal Grinshpoun, et al. · International Journal of Production Research · 5
Minimizing task completion time with the execution set method
2006 · Zohar Laslo, Baruch Keren, et al. · European Journal of Operational Research · 4
On Extremal Multiflows
2000 · Hagai Ilani, Ephraim Korach, et al. · Journal of Combinatorial Theory Series B · 4
Reentrant permutation flow shop problems: definitions and heuristics
2026 · Itamar Segal, Tal Grinshpoun, et al. · Journal of Scheduling · 2
PDF
Bounded colouring motivated by the limited resource partially concurrent open shop problem
2019 · Hagai Ilani, Tal Grinshpoun, et al. · Annals of Operations Research · 1
Perfect matching in bipartite hypergraphs subject to a demand graph
2022 · Lior Aronshtam, Hagai Ilani, et al. · Annals of Operations Research
Graph representation of the fixed route dial-a-ride problem
2022 · Tal Grinshpoun, Elad Shufan, et al. · Journal of Scheduling
A max-min theorem for integer multiflows
1994 · M. V. Lomonosov, Hagai Ilani, et al. · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)
Works count: 13
Citation count: 62
H-index: 5
I10-index: 2
Year
Topic
Type