עקוב אחר
Hagai Ilani
Hagai Ilani
כתובת אימייל מאומתת בדומיין sce.ac.il
כותרת
צוטט על ידי
צוטט על ידי
שנה
A reduction approach to the two-campus transport problem
H Ilani, E Shufan, T Grinshpoun, A Belulu, A Fainberg
Journal of Scheduling 17, 587-599, 2014
182014
Bounds on the average and minimum attendance in preference-based activity scheduling
L Aronshtam, H Ilani
Discrete Applied Mathematics 306, 114-119, 2022
132022
The representation of partially-concurrent open shop problems
T Grinshpoun, H Ilani, E Shufan
Annals of Operations Research 252, 455-469, 2017
102017
Minimizing task completion time with the execution set method
Z Laslo, B Keren, H Ilani
European Journal of Operational Research 187 (3), 1513-1519, 2008
102008
Partially concurrent open shop scheduling with integral preemptions
H Ilani, E Shufan, T Grinshpoun
Annals of Operations Research 259, 157-171, 2017
72017
A fixed route dial-a-ride problem
H Ilani, E Shufan, T Grinshpoun
Proceedings of the 7th Multidisciplinary International Conference on …, 2015
72015
Partially-concurrent open shop scheduling
T Grinshpoun, H Ilani, E Shufan
Proceedings of the 10th international conference of the practice and theory …, 2014
52014
A General Two-directional Two-campus Transport Problem
H Ilani, E Shufan, T Grinshpoun
Proceedings of the 25th European Conference on Operational Research, Vilnius …, 2012
52012
A two-campus transport problem
E Shufan, H Ilani, T Grinshpoun
Proceedings of the 5th Multidisciplinary International Conference on …, 2011
42011
On extremal multiflows
H Ilani, E Korach, M Lomonosov
Journal of Combinatorial Theory, Series B 79 (2), 183-210, 2000
42000
Reentrant flow shop with identical jobs and makespan criterion
E Shufan, T Grinshpoun, E Ikar, H Ilani
International Journal of Production Research 61 (1), 183-197, 2023
32023
Effective pruning heuristics for the fixed route dial-a-ride problem
T Grinshpoun, E Shufan, H Ilani, V Levit, H Brama
Proceedings of the 13th international conference on the practice and theory …, 2021
22021
Reentrant Flow Shop with Identical Jobs and Unit Processing Times
E Ikar, T Grinshpoun, H Ilani, E Shufan
Proceedings of the 9th Multidisciplinary International Conference on …, 2019
22019
Partially concurrent open shop scheduling and graph colourings
H Ilani, E Shufan, T Grinshpoun
Proceedings of the 11th international conference of the practice and theory …, 2016
22016
Graph representation of the fixed route dial-a-ride problem
T Grinshpoun, E Shufan, H Ilani, V Levit, H Brama
Journal of scheduling 26 (5), 479-495, 2023
12023
Bounded colouring motivated by the limited resource partially concurrent open shop problem
H Ilani, T Grinshpoun, E Shufan
Annals of Operations Research 302, 461-476, 2021
12021
Satisfying allocation of plots to tenants
L Aronshtam, H Ilani, E Shufan
Proceedings of the 9th multidisciplinary international conference on …, 2019
12019
Partially concurrent open shop scheduling with preemption and limited resources
H Ilani, T Grinshpoun, E Shufan
Proceedings of the 12th International Conference on the Practice and Theory …, 2018
12018
A LOWER BOUND FOR PROJECT COMPLETION TIME ATTAINED BY DETAILING PROJECT TASKS AND REDISTRIBUTING WORKLOADS.
Z Laslo, H Ilani, B Keren
Journal of Applied Quantitative Methods 4 (3), 2009
12009
Perfect matching in bipartite hypergraphs subject to a demand graph
L Aronshtam, H Ilani, E Shufan
Annals of Operations Research 321 (1), 39-48, 2023
2023
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20