Yantong Li

Yantong Li

Auto-generated profile, based on publicly available information

Yantong Li

Dalian Maritime University

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 February 2022 in Omega
Verified
Journal Article
Closed access
LTLianhua Tang
Lianhua Tang
YLYantong Li
Yantong Li
DBDanyu Bai
Danyu Bai
TLTao Liu
Tao Liu
LCLeandro C. Coelho
Leandro C. Coelho

1 March 2022 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
YLYantong Li
Yantong Li
JCJean-François Côté
Jean-François Côté
LCLeandro Callegari-Coelho
Leandro Callegari-Coelho
PWPeng Wu
Peng Wu
We investigate the discrete parallel machine scheduling and location problem, which consists of locating multiple machines to a set of candidate locations, assigning jobs from different locations to the located machines, and sequencing the assigned jobs. The objective is to minimize the maximum completion time of all jobs, that is, the makespan. Though the problem is of theoretical significance with a wide range of practical applications, it has not been well studied as reported in the literature. For this problem, we first propose three new mixed-integer linear programs that outperform state-of-the-art formulations. Then, we develop a new logic-based Benders decomposition algorithm for practical-sized instances, which splits the problem into a master problem that determines machine locations and job assignments to machines and a subproblem that sequences jobs on each machine. The master problem is solved by a branch-and-cut procedure that operates on a single search tree. Once an incumbent solution to the master problem is found, the subproblem is solved to generate cuts that are dynamically added to the master problem. A generic no-good cut is first proposed, which is later improved by some strengthening techniques. Two optimality cuts are also developed based on optimality conditions of the subproblem and improved by strengthening techniques. Numerical results on small-sized instances show that the proposed formulations outperform state-of-the-art ones. Computational results on 1,400 benchmark instances with up to 300 jobs, 50 machines, and 300 locations demonstrate the effectiveness and efficiency of the algorithm compared with current approaches. Summary of Contribution: This paper employs operations research methods and computing techniques to address an NP-hard combinatorial optimization problem: the parallel discrete machine scheduling and location problem. The problem is of practical significance but has not been well studied in the literature. For the problem, we formulate three novel mixed-integer linear programs that outperform state-of-the-art formulations and develop a new logic-based Benders decomposition algorithm. Extensive computational experiments on 1,400 benchmark instances with up to 300 jobs, 50 machines, and 300 locations are conducted to evaluate the performance of the proposed models and algorithms.

1 November 2021 in Computers & Operations Research
Verified
Journal Article
Closed access
LTLianhua Tang
Lianhua Tang
ADAndrea D’ARiano
Andrea D’ARiano
XXXingfang Xu
Xingfang Xu
YLYantong Li
Yantong Li
XDXiaobing Ding
Xiaobing Ding
MSMarcella Samà
Marcella Samà

22 January 2022 in Computers & Operations Research
Verified
Journal Article
Closed access
CZChuang Zhang
Chuang Zhang
YLYantong Li
Yantong Li
JCJunhai Cao
Junhai Cao
XWXin Wen
Xin Wen

20 May 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
YLYantong Li
Yantong Li
JCJean-François Côté
Jean-François Côté
LCLeandro C. Coelho
Leandro C. Coelho
CZChuang Zhang
Chuang Zhang
Shuai ZhangShuai Zhang
Shuai Zhang

2 November 2023 in International Journal of Production Research
Verified
Journal Article
Closed access
YZYipei Zhang
Yipei Zhang
Feng ChuFeng Chu
Feng Chu
ACAda Che
Ada Che
YLYantong Li
Yantong Li