Seguir
lei shang
lei shang
Alibaba Group
Dirección de correo verificada de alibaba-inc.com
Título
Citado por
Citado por
Año
Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees
L Shang, V t’Kindt, F Della Croce
Computers & Operations Research 128, 105171, 2021
16*2021
Exact exponential algorithms for 3-machine flowshop scheduling problems
L Shang, C Lenté, M Liedloff, V T’Kindt
Journal of Scheduling 21, 227-233, 2018
13*2018
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
V T’kindt, L Shang, F Della Croce
Journal of Combinatorial Optimization 39 (3), 764-775, 2020
122020
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
M Garraffa, L Shang, F Della Croce, V T'kindt
Theoretical Computer Science 745, 133-149, 2018
12*2018
A Sort & Search method for multicriteria optimization problems with applications to scheduling theory
VT Lei Shang
Journal of Multi-Criteria Decision Analysis 26 (1-2), 84-90, 2019
42019
Exact algorithms with worst-case guarantee for scheduling: From theory to practice
L Shang
arXiv preprint arXiv:1712.02103, 2017
32017
An Exact Exponential Branch-and-Merge Algorithm for the Single Machine Total Tardiness Problem
L Shang, M Garraffa, F Della Croce, V t'Kindt
16th International Conference on Project Management and Scheduling (PMS 16), 2016
32016
Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem
L Shang, M Garraffa, F Della Croce, V T'kindt
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 2018
22018
Exact solution of the single machine total tardiness problem: The power of memorization
L Shang, V T’Kindt, F Della Croce
7th International Conference on Industrial Engineering and System Management …, 2017
22017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–9