L
Liqi Zhang
Researcher at Zhengzhou University
Publications - 8
Citations - 375
Liqi Zhang is an academic researcher from Zhengzhou University. The author has contributed to research in topics: Job shop scheduling & Single-machine scheduling. The author has an hindex of 7, co-authored 8 publications receiving 324 citations.
Papers
More filters
Journal ArticleDOI
Single machine scheduling with release dates and rejection
TL;DR: This paper considers the single machine scheduling problem with release dates and rejection, shows that the problem is NP-hard in the ordinary sense, and provides two pseudo-polynomial-time algorithms that can be solved in polynomial-time.
Journal ArticleDOI
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
TL;DR: This paper shows that this problem is binary NP-hard and provides a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme for the unbounded parallel batch machine scheduling with release dates and rejection.
Journal ArticleDOI
Single-machine scheduling under the job rejection constraint
TL;DR: This paper provides a fully polynomial-time approximation scheme for the makespan problem with release dates and analyzes the computational complexities of the problems for distinct objective functions and presents pseudo-polynomial-time algorithms.
Journal ArticleDOI
Bounded single-machine parallel-batch scheduling with release dates and rejection
TL;DR: This work considers the bounded single-machine parallel-batch scheduling problem with release dates and rejection, and provides a 2-approximation algorithm and a polynomial-time approximation scheme for the general problem.
Journal ArticleDOI
Single machine scheduling with release dates and job delivery to minimize the makespan
TL;DR: A polynomial-time algorithm is given for single machine scheduling with release dates and job delivery and it is shown that this problem is strongly NP-hard for each fixed c>=1.