Yann Hendel

According to our database, Yann Hendel authored at least 4 papers between 2006 and 2015.

Collaborative distances:

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

2015

Scheduling semi-malleable jobs to minimize mean flow time.

Yann Hendel, Wieslaw Kubiak, Denis Trystram

J. Sched., 2015

2009

The one-machine just-in-time scheduling problem with preemption.

Yann Hendel, Nina Runge, Francis Sourd

Discret. Optim., 2009

2007

An improved earliness-tardiness timing algorithm.

Yann Hendel, Francis Sourd

Comput. Oper. Res., 2007

2006

Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem.

Yann Hendel, Francis Sourd

Eur. J. Oper. Res., 2006