Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. - Yann Hendel; Francis Sourd (Eur. J. Oper. Res., 2006)

An improved earliness-tardiness timing algorithm. - Yann Hendel; Francis Sourd (Comput. Oper. Res., 2007)

The one-machine just-in-time scheduling problem with preemption. - Yann Hendel; Nina Runge; Francis Sourd (Discret. Optim., 2009)

Scheduling semi-malleable jobs to minimize mean flow time. - Yann Hendel; Wieslaw Kubiak; Denis Trystram (J. Sched., 2015)