| 2009 |
|---|
| 35 | EE | Jinjiang Yuan,
Shisheng Li,
Ji Tian,
Ruyan Fu:
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.
J. Comb. Optim. 17(2): 206-213 (2009) |
| 34 | EE | Ji Tian,
Ruyan Fu,
Jinjiang Yuan:
A best online algorithm for scheduling on two parallel batch machines.
Theor. Comput. Sci. 410(21-23): 2291-2294 (2009) |
| 33 | EE | Xianglai Qi,
Shiguo Zhou,
Jinjiang Yuan:
Single machine parallel-batch scheduling with deteriorating jobs.
Theor. Comput. Sci. 410(8-10): 830-836 (2009) |
| 2008 |
|---|
| 32 | EE | Lingfa Lu,
Jinjiang Yuan:
Single Machine Scheduling with Job Delivery to minimize makespan.
APJOR 25(1): 1-10 (2008) |
| 31 | EE | Jinjiang Yuan,
Xianglai Qi,
Lingfa Lu,
Wenhua Li:
Single machine unbounded parallel-batch scheduling with forbidden intervals.
European Journal of Operational Research 186(3): 1212-1217 (2008) |
| 30 | EE | Qin Wang,
Jinjiang Yuan,
Jianzhong Zhang:
An inverse model for the most uniform problem.
Oper. Res. Lett. 36(1): 26-30 (2008) |
| 29 | EE | Ruyan Fu,
Ji Tian,
Jinjiang Yuan,
Cheng He:
On-line scheduling on a batch machine to minimize makespan with limited restarts.
Oper. Res. Lett. 36(2): 255-258 (2008) |
| 28 | EE | Lingfa Lu,
Jinjiang Yuan:
Unbounded parallel batch scheduling with job delivery to minimize makespan.
Oper. Res. Lett. 36(4): 477-480 (2008) |
| 27 | EE | Lingfa Lu,
Jinjiang Yuan,
Liqi Zhang:
Single machine scheduling with release dates and job delivery to minimize the makespan.
Theor. Comput. Sci. 393(1-3): 102-108 (2008) |
| 26 | EE | Ji Tian,
Ruyan Fu,
Jinjiang Yuan:
A best on-line algorithm for single machine scheduling with small delivery times.
Theor. Comput. Sci. 393(1-3): 287-293 (2008) |
| 25 | EE | Lingfa Lu,
Liqi Zhang,
Jinjiang Yuan:
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan.
Theor. Comput. Sci. 396(1-3): 283-289 (2008) |
| 2007 |
|---|
| 24 | EE | Jinjiang Yuan,
Yundong Mu,
Lingfa Lu,
Wenhua Li:
Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan.
APJOR 24(6): 789-796 (2007) |
| 23 | EE | Zhao Zhang,
Jinjiang Yuan:
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal.
Discrete Mathematics 307(2): 293-298 (2007) |
| 22 | EE | Jinjiang Yuan,
Ameur Soukhal,
Youjun Chen,
Lingfa Lu:
A note on the complexity of flow shop scheduling with transportation constraints.
European Journal of Operational Research 178(3): 918-925 (2007) |
| 21 | EE | Jinjiang Yuan,
Yundong Mu:
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption.
European Journal of Operational Research 182(2): 936-944 (2007) |
| 20 | EE | Wenhua Li,
Jinjiang Yuan,
Yixun Lin:
A note on special optimal batching structures to minimize total weighted completion time.
J. Comb. Optim. 14(4): 475-480 (2007) |
| 19 | EE | Jinjiang Yuan,
Jian Ying Zhang,
Sanming Zhou:
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem.
J. Discrete Algorithms 5(3): 609-621 (2007) |
| 18 | EE | Ruyan Fu,
Ji Tian,
Jinjiang Yuan,
Yixun Lin:
Online scheduling in a parallel batch processing system to minimize makespan using restarts.
Theor. Comput. Sci. 374(1-3): 196-202 (2007) |
| 17 | EE | Ji Tian,
Ruyan Fu,
Jinjiang Yuan:
On-line scheduling with delivery time on a single batch machine.
Theor. Comput. Sci. 374(1-3): 49-57 (2007) |
| 16 | EE | Cheng He,
Yixun Lin,
Jinjiang Yuan:
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan.
Theor. Comput. Sci. 381(1-3): 234-240 (2007) |
| 2006 |
|---|
| 15 | EE | Xiyong Zhang,
Hua Guo,
Jinjiang Yuan:
A Note of Perfect Nonlinear Functions.
CANS 2006: 259-269 |
| 14 | EE | Aifeng Yang,
Jinjiang Yuan:
Partition the vertices of a graph into one independent set and one acyclic set.
Discrete Mathematics 306(12): 1207-1216 (2006) |
| 13 | EE | Weiping Shang,
Jinjiang Yuan:
Upper minus domination in a claw-free cubic graph.
Discrete Mathematics 306(22): 2983-2988 (2006) |
| 12 | EE | Wenhua Li,
Maurice Queyranne,
Maxim Sviridenko,
Jinjiang Yuan:
Approximation algorithms for shop scheduling problems with minsum objective: A correction.
J. Scheduling 9(6): 569-570 (2006) |
| 2005 |
|---|
| 11 | EE | Zhao Zhang,
Jinjiang Yuan:
A proof of an inequality concerning k-restricted edge connectivity.
Discrete Mathematics 304(1-3): 128-134 (2005) |
| 10 | EE | Jinjiang Yuan,
Yixun Lin:
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria.
European Journal of Operational Research 164(3): 851-855 (2005) |
| 2004 |
|---|
| 9 | EE | Jinjiang Yuan,
Sanming Zhou:
Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.
Journal of Interconnection Networks 5(2): 193-200 (2004) |
| 2003 |
|---|
| 8 | EE | Jinjiang Yuan,
Qin Wang:
Partition the vertices of a graph into induced matchings.
Discrete Mathematics 263(1-3): 323-329 (2003) |
| 7 | EE | Zhaohui Liu,
Jinjiang Yuan,
T. C. Edwin Cheng:
On scheduling an unbounded batch machine.
Oper. Res. Lett. 31(1): 42-48 (2003) |
| 2001 |
|---|
| 6 | EE | Qin Wang,
Jinjiang Yuan:
Maximal IM-unextendable graphs.
Discrete Mathematics 240(1-3): 295-298 (2001) |
| 2000 |
|---|
| 5 | EE | Liying Kang,
Jinjiang Yuan:
Bondage number of planar graphs.
Discrete Mathematics 222(1-3): 191-198 (2000) |
| 1998 |
|---|
| 4 | EE | Sanming Zhou,
Jinjiang Yuan:
Harper-type lower bounds and the bandwidths of the compositions of graphs.
Discrete Mathematics 181(1-3): 255-266 (1998) |
| 1996 |
|---|
| 3 | | Jinjiang Yuan:
Path-width and tree-width of the join of graphs.
Ars Comb. 43: (1996) |
| 2 | | Qiongxiang Huang,
Jinjiang Yuan:
The automorphism groups of circulant digraphs of degree 3.
Ars Comb. 44: (1996) |
| 1995 |
|---|
| 1 | EE | Jinjiang Yuan:
A local reductive elimination for the fill-in of graphs.
Discrete Mathematics 147(1-3): 321-327 (1995) |
