Jin Qian

Dr. Jin Qian

Northeastern University, Shenyang 110819, Liaoning Province, China

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
3 August 2021 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
Jin QianJin Qian
Jin Qian
HHHaiyan Han
Haiyan Han

19 March 2024 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
Jin QianJin Qian
Jin Qian
GCGuisong Chang
Guisong Chang
XZXue Zhang
Xue Zhang

4 June 2024 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
Jin QianJin Qian
Jin Qian
ZGZhiyuan Guo
Zhiyuan Guo

30 November 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Jin QianJin Qian
Jin Qian
Yu ZhanYu Zhan
Yu Zhan
This paper considers a single-machine scheduling problem with past-sequence-dependent delivery times and the truncated sum-of-processing-times-based learning effect. The goal is to minimize the total costs that comprise the number of early jobs, the number of tardy jobs and due date. The due date is a decision variable. There will be corresponding penalties for jobs that are not completed on time. Under the common due date, slack due date and different due date, we prove that these problems are polynomial time solvable. Three polynomial time algorithms are proposed to obtain the optimal sequence.

22 November 2021 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
Jin QianJin Qian
Jin Qian
HHHaiyan Han
Haiyan Han

13 May 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
Jin QianJin Qian
Jin Qian
Yu ZhanYu Zhan
Yu Zhan
This paper considers the single machine scheduling problem with due window, delivery time and deteriorating job, whose goal is to minimize the window location, window size, earliness and tardiness. Common due window and slack due window are considered. The delivery time depends on the actual processing time of past sequences. The actual processing time of the job is an increasing function of the start time. Based on the small perturbations technique and adjacent exchange technique, we obtain the propositions of the problems. For common and slack due window assignment, we prove that the two objective functions are polynomial time solvable in O(nlogn) time. We propose the corresponding algorithms to obtain the optimal sequence, window location and window size.