Elad Shufan

According to our database, Elad Shufan authored at least 7 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Graph representation of the fixed route dial-a-ride problem.

Tal Grinshpoun, Elad Shufan, Hagai Ilani, Vadim Levit, Haya Brama

J. Sched., October, 2023

Perfect matching in bipartite hypergraphs subject to a demand graph.

Lior Aronshtam, Hagai Ilani, Elad Shufan

Ann. Oper. Res., February, 2023

Reentrant flow shop with identical jobs and makespan criterion.

Elad Shufan, Tal Grinshpoun, Ehud Ikar, Hagai Ilani

Int. J. Prod. Res., 2023

2021

Bounded colouring motivated by the limited resource partially concurrent open shop problem.

Hagai Ilani, Tal Grinshpoun, Elad Shufan

Ann. Oper. Res., 2021

2017

Partially concurrent open shop scheduling with integral preemptions.

Hagai Ilani, Elad Shufan, Tal Grinshpoun

Ann. Oper. Res., 2017

The representation of partially-concurrent open shop problems.

Tal Grinshpoun, Hagai Ilani, Elad Shufan

Ann. Oper. Res., 2017

2014

A reduction approach to the two-campus transport problem.

Hagai Ilani, Elad Shufan, Tal Grinshpoun, Aviad Belulu, Alex Fainberg

J. Sched., 2014