J
Jinjiang Yuan
Researcher at Zhengzhou University
Publications - 151
Citations - 2081
Jinjiang Yuan is an academic researcher from Zhengzhou University. The author has contributed to research in topics: Job shop scheduling & Scheduling (computing). The author has an hindex of 23, co-authored 137 publications receiving 1690 citations.
Papers
More filters
Journal ArticleDOI
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
TL;DR: A 3/2-approximation algorithm and a polynomial-time approximation scheme for two-stage scheduling problem in which n jobs are first processed on m identical machines at a manufacturing facility and then delivered to their customers by one vehicle which can deliver one job at each shipment.
Journal ArticleDOI
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
Wenjie Li,Jinjiang Yuan +1 more
TL;DR: This paper considers the online scheduling of equal-length jobs with incompatible families on identical batch machines and presents an online algorithm with a competitive ratio of 3 for both b=\infty and b
Journal ArticleDOI
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
Long Wan,Ran Ma,Jinjiang Yuan +2 more
TL;DR: This paper analyzes the classic algorithm SPT, which schedules jobs to machines greedily in the order of non-decreasing processing times, and presents another algorithm, called RSPT, with the worst-case ratio of at most 3/2 and at least 11/9.
Journal ArticleDOI
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption
TL;DR: In this article, the authors considered single-machine bicriteria scheduling of n jobs with preemption to minimize the total late work and maximum tardiness, and presented an O( n ) -time algorithm for the hierarchical scheduling problem.
Journal ArticleDOI
Online scheduling of incompatible unit-length job families with lookahead
TL;DR: A best possible online algorithm of competitive ratio 1+αf for 0≤β<1, where αf is the positive root of the equation f⋅αf2+(1+β)αf+β−f=0 and f is the number of job families which is known in advance.