Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jinjiang Yuan
2010 – today
- 2013
[j67]Ruifang Liu, Huicai Jia, Jinjiang Yuan: Tree with minimal Laplacian spectral radius and diameter n-4. Ars Comb. 109: 345-352 (2013)- [j66]Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan: An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Oper. Res. Lett. 41(3): 216-219 (2013)
- [j65]Long Wan, Jinjiang Yuan: Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. Oper. Res. Lett. 41(4): 363-365 (2013)
- [j64]Qiulan Zhao, Jinjiang Yuan: Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption. J. Scheduling 16(3): 253-260 (2013)
- 2012
- [j63]Ji Tian, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discrete Applied Mathematics 160(7-8): 1191-1210 (2012)
- [j62]Wenjie Li, Zhenkun Zhang, Hailing Liu, Jinjiang Yuan: Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs. Inf. Process. Lett. 112(12): 503-508 (2012)
- [j61]Shisheng Li, Jinjiang Yuan: Unbounded parallel-batching scheduling with two competitive agents. J. Scheduling 15(5): 629-640 (2012)
- [j60]Junling Yuan, Wenhua Li, Jinjiang Yuan: A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. Theor. Comput. Sci. 457: 174-180 (2012)
- 2011
- [j59]Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng: Best semi-online algorithms for unbounded parallel batch scheduling. Discrete Applied Mathematics 159(8): 838-847 (2011)
- [j58]Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan: Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. European Journal of Operational Research 210(3): 482-488 (2011)
- [j57]Jianfa Cao, Jinjiang Yuan, Wenjie Li, Hailin Bu: Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times. Int. J. Systems Science 42(1): 51-55 (2011)
- [j56]Shisheng Li, Jinjiang Yuan, Baoqiang Fan: Unbounded parallel-batch scheduling with family jobs and delivery coordination. Inf. Process. Lett. 111(12): 575-582 (2011)
- [j55]Wenhua Li, Jinjiang Yuan: Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time. Inf. Process. Lett. 111(18): 907-911 (2011)
- [j54]Ji Tian, Ruyan Fu, Jinjiang Yuan: An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. Inf. Process. Lett. 111(21-22): 1048-1053 (2011)
- [j53]Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. J. Scheduling 14(4): 361-369 (2011)
- [j52]Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on unbounded parallel-batch machines with incompatible job families. Theor. Comput. Sci. 412(22): 2380-2386 (2011)
- 2010
- [j51]
- [j50]Cheng He, Yixun Lin, Jinjiang Yuan: A note on the single machine scheduling to minimize the number of tardy jobs with deadlines. European Journal of Operational Research 201(3): 966-970 (2010)
- [j49]Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. Inf. Process. Lett. 110(11): 444-450 (2010)
- [j48]Shisheng Li, Jinjiang Yuan: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan. J. Comb. Optim. 19(1): 84-93 (2010)
- [j47]Liqi Zhang, Lingfa Lu, Jinjiang Yuan: Single-machine scheduling under the job rejection constraint. Theor. Comput. Sci. 411(16-18): 1877-1882 (2010)
- [j46]C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan: Preemptive scheduling with simple linear deterioration on a single machine. Theor. Comput. Sci. 411(40-42): 3578-3586 (2010)
- [j45]Shisheng Li, Jinjiang Yuan: Parallel-machine scheduling with deteriorating jobs and rejection. Theor. Comput. Sci. 411(40-42): 3642-3650 (2010)
2000 – 2009
- 2009
- [j44]Lingfa Lu, T. C. Edwin Cheng, Jinjiang Yuan, Liqi Zhang: Bounded single-machine parallel-batch scheduling with release dates and rejection. Computers & OR 36(10): 2748-2751 (2009)
- [j43]Xiumei Wang, Jinjiang Yuan, Sujing Zhou: Edge-deletable IM-extendable graphs with minimum number of edges. Discrete Mathematics 309(16): 5242-5247 (2009)
- [j42]Liqi Zhang, Lingfa Lu, Jinjiang Yuan: Single machine scheduling with release dates and rejection. European Journal of Operational Research 198(3): 975-978 (2009)
- [j41]Cheng He, Yixun Lin, Jinjiang Yuan: A DP algorithm for minimizing makespan and total completion time on a series-batching machine. Inf. Process. Lett. 109(12): 603-607 (2009)
- [j40]Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan: Online scheduling on unbounded parallel-batch machines to minimize the makespan. Inf. Process. Lett. 109(21-22): 1211-1215 (2009)
- [j39]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)
- [j38]Qingqin Nong, Jinjiang Yuan, Yixun Lin: The weighted link ring loading problem. J. Comb. Optim. 18(1): 38-50 (2009)
- [j37]Ruyan Fu, Ji Tian, Jinjiang Yuan: On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. J. Scheduling 12(1): 91-97 (2009)
- [j36]Xianglai Qi, Shiguo Zhou, Jinjiang Yuan: Single machine parallel-batch scheduling with deteriorating jobs. Theor. Comput. Sci. 410(8-10): 830-836 (2009)
- [j35]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)
- [j34]Shisheng Li, Jinjiang Yuan: Scheduling with families of jobs and delivery coordination under job availability. Theor. Comput. Sci. 410(47-49): 4856-4863 (2009)
- [j33]Wenjie Li, Jinjiang Yuan, Jianfa Cao, Hailin Bu: Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead. Theor. Comput. Sci. 410(47-49): 5182-5187 (2009)
- 2008
- [j32]
- [j31]
- [j30]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)
- [j29]Qin Wang, Jinjiang Yuan, Jianzhong Zhang: An inverse model for the most uniform problem. Oper. Res. Lett. 36(1): 26-30 (2008)
- [j28]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)
- [j27]Lingfa Lu, Jinjiang Yuan: Unbounded parallel batch scheduling with job delivery to minimize makespan. Oper. Res. Lett. 36(4): 477-480 (2008)
- [j26]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)
- [j25]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)
- [j24]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
- [j23]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)
- [j22]Zhao Zhang, Jinjiang Yuan: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. Discrete Mathematics 307(2): 293-298 (2007)
- [j21]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)
- [j20]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)
- [j19]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)
- [j18]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)
- [j17]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)
- [j16]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)
- [j15]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
- [j14]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)
- [j13]Weiping Shang, Jinjiang Yuan: Upper minus domination in a claw-free cubic graph. Discrete Mathematics 306(22): 2983-2988 (2006)
- [j12]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)
- [c1]
- 2005
- [j11]Zhao Zhang, Jinjiang Yuan: A proof of an inequality concerning k-restricted edge connectivity. Discrete Mathematics 304(1-3): 128-134 (2005)
- [j10]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
- [j9]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
- [j8]Jinjiang Yuan, Qin Wang: Partition the vertices of a graph into induced matchings. Discrete Mathematics 263(1-3): 323-329 (2003)
- [j7]Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng: On scheduling an unbounded batch machine. Oper. Res. Lett. 31(1): 42-48 (2003)
- 2001
- [j6]Qin Wang, Jinjiang Yuan: Maximal IM-unextendable graphs. Discrete Mathematics 240(1-3): 295-298 (2001)
- 2000
- [j5]Liying Kang, Jinjiang Yuan: Bondage number of planar graphs. Discrete Mathematics 222(1-3): 191-198 (2000)
1990 – 1999
- 1998
- [j4]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
- [j3]
- [j2]Qiongxiang Huang, Jinjiang Yuan: The automorphism groups of circulant digraphs of degree 3. Ars Comb. 44 (1996)
- 1995
- [j1]Jinjiang Yuan: A local reductive elimination for the fill-in of graphs. Discrete Mathematics 147(1-3): 321-327 (1995)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 22:21 CEST by the dblp team