Lei Shang

According to our database, Lei Shang authored at least 7 papers between 2017 and 2021.

Collaborative distances:

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

2021

<i>Branch</i> & <i>Memorize</i> exact algorithms for sequencing problems: Efficient embedding of memorization into search trees.

Lei Shang, Vincent T'kindt, Federico Della Croce

Comput. Oper. Res., 2021

2020

Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights.

Vincent T'kindt, Lei Shang, Federico Della Croce

J. Comb. Optim., 2020

2018

An exact exponential branch-and-merge algorithm for the single machine total tardiness problem.

Michele Garraffa, Lei Shang, Federico Della Croce, Vincent T'kindt

Theor. Comput. Sci., 2018

Exact exponential algorithms for 3-machine flowshop scheduling problems.

Lei Shang, Christophe Lenté, Mathieu Liedloff, Vincent T'kindt

J. Sched., 2018

2017

Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice. (Algorithmes Exacts Avec Garantie au Pire Cas Pour l'Ordonnancement: de la Théorie à la Pratique).

Lei Shang

PhD thesis, 2017

Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice.

Lei Shang

CoRR, 2017

Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem.

Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017