Jinjiang Yuan

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 70

Top Venues

Theor. Comput. Sci.

J. Comb. Optim.

J. Sched.

Asia Pac. J. Oper. Res.

Publications

Qiulan Zhao, Jinjiang Yuan
Single-machine primary-secondary scheduling with total tardiness being the primary criterion. J. Sched. 27 (3) (2024)
Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs. Discret. Appl. Math. 345 (2024)
Qixuan Yuan, Ruifang Liu, Jinjiang Yuan
-free graphs. Appl. Math. Comput. 469 (2024)
Zhichao Geng, Jinjiang Yuan
Single-machine scheduling of multiple projects with controllable processing times. Eur. J. Oper. Res. 308 (3) (2023)
Qixuan Yuan, Ruifang Liu, Jinjiang Yuan
The Aα-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree). Discret. Optim. 47 (2023)
Guoyan Ao, Ruifang Liu, Jinjiang Yuan
Spectral radius and spanning trees of graphs. Discret. Math. 346 (8) (2023)
Rubing Chen, Yuan Gao, Zhichao Geng, Jinjiang Yuan
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. Int. J. Prod. Res. 61 (22) (2023)
Shanshan Guo, Fei Huang, Jinjiang Yuan
Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs. Graphs Comb. 39 (6) (2023)
Rubing Chen, Ruyan He, Jinjiang Yuan
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs. Comput. Ind. Eng. 167 (2022)
Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. 4OR 20 (2) (2022)
Yipei Zhang, Xiumei Wang, Jinjiang Yuan
Bicritical graphs without removable edges. Discret. Appl. Math. 320 (2022)
Shanshan Guo, Fei Huang, Jinjiang Yuan
Properly colored 2-factors of edge-colored complete bipartite graphs. Discret. Math. 345 (12) (2022)
Guoyan Ao, Ruifang Liu, Jinjiang Yuan, Rao Li
Improved sufficient conditions for k-leaf-connected graphs. Discret. Appl. Math. 314 (2022)
Runjie Miao, Jinjiang Yuan
A note on LP-based approximation algorithms for capacitated facility location problem. Theor. Comput. Sci. 932 (2022)
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
On cycle-nice claw-free graphs. Discret. Math. 345 (7) (2022)
Rubing Chen, Zhichao Geng, Lingfa Lu, Jinjiang Yuan, Yuan Zhang
Pareto-scheduling of two competing agents with their own equal processing times. Eur. J. Oper. Res. 301 (2) (2022)
Luyi Li, Fei Huang, Jinjiang Yuan
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three. Discret. Math. 345 (6) (2022)
Yuan Zhang, Jinjiang Yuan
A note on the complexity of two supply chain scheduling problems. J. Sched. 24 (4) (2021)
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. Eur. J. Oper. Res. 293 (1) (2021)
Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
A note on competing-agent Pareto-scheduling. Optim. Lett. 15 (1) (2021)
Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. J. Comb. Optim. 41 (2) (2021)
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. Comput. Ind. Eng. 159 (2021)
Rubing Chen, Jinjiang Yuan
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. Discret. Appl. Math. 304 (2021)
Qiulan Zhao, Jinjiang Yuan
Scheduling to tradeoff between the number and the length of accepted jobs. Theor. Comput. Sci. 891 (2021)
Wenjie Li, Jinjiang Yuan
Single-machine online scheduling of jobs with non-delayed processing constraint. J. Comb. Optim. 41 (4) (2021)
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan
Even cycles and perfect matchings in claw-free plane graphs. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Shi-Sheng Li, Jinjiang Yuan
Single-machine scheduling with multi-agents to minimize total weighted late work. J. Sched. 23 (4) (2020)
Qiulan Zhao, Jinjiang Yuan
Bicriteria scheduling of equal length jobs on uniform parallel machines. J. Comb. Optim. 39 (3) (2020)
Fei Huang, Shanshan Guo, Jinjiang Yuan
A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs. SIAM J. Discret. Math. 34 (3) (2020)
Rubing Chen, Jinjiang Yuan
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR 18 (2) (2020)
Rubing Chen, Jinjiang Yuan, Zhichao Geng
ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost. Appl. Math. Comput. 365 (2020)
Juan Zou, Jinjiang Yuan
Single-machine scheduling with maintenance activities and rejection. Discret. Optim. 38 (2020)
Jinjiang Yuan, Chi To Ng, T. C. E. Cheng
Scheduling with release dates and preemption to minimize multiple max-form objective functions. Eur. J. Oper. Res. 280 (3) (2020)
Yuan Gao, Jinjiang Yuan
Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs. J. Comb. Optim. 38 (3) (2019)
Yuan Gao, Jinjiang Yuan, Chi To Ng, T. C. E. Cheng
A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. Eur. J. Oper. Res. 273 (1) (2019)
Rubing Chen, Jinjiang Yuan, Yuan Gao
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. J. Sched. 22 (5) (2019)
Rubing Chen, Jinjiang Yuan, Lingfa Lu
Single-machine scheduling with positional due indices and positional deadlines. Discret. Optim. 34 (2019)
Fei Huang, Jinjiang Yuan
On strong proper connection number of cubic graphs. Discret. Appl. Math. 265 (2019)
Chengwen Jiao, Jinjiang Yuan, Qi Feng
Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead. Asia Pac. J. Oper. Res. 36 (5) (2019)
Xiaozheng Chen, Fei Huang, Jinjiang Yuan
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles. Discret. Appl. Math. 265 (2019)
Qiulan Zhao, Jinjiang Yuan
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine. Oper. Res. Lett. 47 (6) (2019)
Yuan Zhang, Jinjiang Yuan
A note on a two-agent scheduling problem related to the total weighted late work. J. Comb. Optim. 37 (3) (2019)
Xianglai Qi, Jinjiang Yuan
Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing. Asia Pac. J. Oper. Res. 36 (1) (2019)
Hongjun Wei, Jinjiang Yuan
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time. Oper. Res. Lett. 47 (1) (2019)
Yuan Gao, Jinjiang Yuan, Zhigang Wei
Unbounded parallel-batch scheduling with drop-line tasks. J. Sched. 22 (4) (2019)
Rubing Chen, Jinjiang Yuan
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. J. Sched. 22 (5) (2019)
Runjie Miao, Jinjiang Yuan, Fei Huang
Paths and trails in edge-colored weighted graphs. Theor. Comput. Sci. 799 (2019)
Zhichao Geng, Jinjiang Yuan, Junling Yuan
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost. Appl. Math. Comput. 332 (2018)
Long Wan, Jinjiang Yuan
Single-machine scheduling with operator non-availability to minimize total weighted completion time. Inf. Sci. (2018)
Qijia Liu, Jinjiang Yuan
Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery. Asia Pac. J. Oper. Res. 35 (4) (2018)
Jinjiang Yuan
Complexities of four problems on two-agent scheduling. Optim. Lett. 12 (4) (2018)
Qiulan Zhao, Jinjiang Yuan
Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs. Asia Pac. J. Oper. Res. 34 (5) (2017)
Long Wan, Lijun Wei, Naixue Xiong, Jinjiang Yuan, Jiacai Xiong
Pareto optimization for the two-agent scheduling problems with linear non-increasing deterioration based on Internet of Things. Future Gener. Comput. Syst. 76 (2017)
Ruyan Fu, Ji Tian, Shisheng Li, Jinjiang Yuan
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities. J. Comb. Optim. 34 (4) (2017)
Ran Ma, Jinjiang Yuan
Online scheduling to minimize the total weighted completion time plus the rejection cost. J. Comb. Optim. 34 (2) (2017)
Xianglai Qi, Jinjiang Yuan
Semi-online hierarchical scheduling for $$l_p$$ l p -norm load balancing with buffer or rearrangements. 4OR 15 (3) (2017)
Xianglai Qi, Jinjiang Yuan
A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost. Comput. Ind. Eng. 111 (2017)
Jinjiang Yuan
Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans. J. Comb. Optim. 34 (2) (2017)
Yuan Gao, Jinjiang Yuan
Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. Discret. Optim. 25 (2017)
Jinjiang Yuan
Unary NP-hardness of minimizing the number of tardy jobs with deadlines. J. Sched. 20 (2) (2017)
Ji Tian, Qian Wang, Ruyan Fu, Jinjiang Yuan
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time. Theor. Comput. Sci. 617 (2016)
Hailing Liu, Jinjiang Yuan, Wenjie Li
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart. J. Comb. Optim. 31 (4) (2016)
Wenjie Li, Jinjiang Yuan
LPT online strategy for parallel-machine scheduling with kind release times. Optim. Lett. 10 (1) (2016)
Long Wan, Jinjiang Yuan, Lijun Wei
Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost. Appl. Math. Comput. 273 (2016)
Yuan Gao, Jinjiang Yuan
Unary NP-hardness of minimizing total weighted tardiness with generalized due dates. Oper. Res. Lett. 44 (1) (2016)
Ran Ma, Jiping Tao, Jinjiang Yuan
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Appl. Math. Comput. 273 (2016)
Liqi Zhang, Lingfa Lu, Jinjiang Yuan
Two-machine open-shop scheduling with rejection to minimize the makespan. OR Spectr. 38 (2) (2016)
Youjun Chen, Lingfa Lu, Jinjiang Yuan
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time. Theor. Comput. Sci. 622 (2016)
Qijia Liu, Jinjiang Yuan
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness. J. Comb. Optim. 32 (2) (2016)
Qiulan Zhao, Lingfa Lu, Jinjiang Yuan
Rescheduling with new orders and general maximum allowable time disruptions. 4OR 14 (3) (2016)
Yuan Gao, Jinjiang Yuan
Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates. Discret. Appl. Math. 189 (2015)
Long Wan, Jinjiang Yuan, Zhichao Geng
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints. J. Sched. 18 (3) (2015)
Wenjie Li, Jinjiang Yuan
An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead. Asia Pac. J. Oper. Res. 32 (6) (2015)
Youjun Chen, Lingfa Lu, Jinjiang Yuan
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time. Theor. Comput. Sci. 583 (2015)
Xiumei Wang, Weiping Shang, Jinjiang Yuan
On Graphs with a Unique Perfect Matching. Graphs Comb. 31 (5) (2015)
Zhichao Geng, Jinjiang Yuan
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness. Theor. Comput. Sci. 570 (2015)
Wenhua Li, Jie Gao, Jinjiang Yuan
Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan. Asia Pac. J. Oper. Res. 32 (4) (2015)
Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. J. Sched. 18 (2) (2015)
Zhichao Geng, Jinjiang Yuan
A note on unbounded parallel-batch scheduling. Inf. Process. Lett. 115 (12) (2015)
Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
Single-machine batch scheduling with job processing time compatibility. Theor. Comput. Sci. 583 (2015)
Yuan Gao, Jinjiang Yuan
A note on Pareto minimizing total completion time and maximum cost. Oper. Res. Lett. 43 (1) (2015)
Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan. Inf. Process. Lett. 114 (4) (2014)
Xiumei Wang, Xiaoxin Song, Jinjiang Yuan
On matching cover of graphs. Math. Program. 147 (1-2) (2014)
Hailing Liu, Jinjiang Yuan
Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart. Theor. Comput. Sci. 543 (2014)
Long Wan, Ran Ma, Jinjiang Yuan
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines. Theor. Comput. Sci. 518 (2014)
Fei Huang, Xiumei Wang, Jinjiang Yuan
-minor-free graphs of diameter 2. Discret. Math. 322 (2014)
Cheng He, Hao Lin, Jinjiang Yuan, Yundong Mu
Batching Machine Scheduling with bicriteria: Maximum Cost and makespan. Asia Pac. J. Oper. Res. 31 (4) (2014)
Chengwen Jiao, Wenhua Li, Jinjiang Yuan
A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines. Asia Pac. J. Oper. Res. 31 (4) (2014)
Wenjie Li, Jinjiang Yuan
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs. Optim. Lett. 8 (5) (2014)
Wenhua Li, Jinjiang Yuan, Sufang Yang
Online scheduling of incompatible unit-length job families with lookahead. Theor. Comput. Sci. 543 (2014)
S. S. Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, Natalia V. Shakhlevich, Jinjiang Yuan
A note on reverse scheduling with maximum lateness objective. J. Sched. 16 (4) (2013)
Long Wan, Jinjiang Yuan
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. Oper. Res. Lett. 41 (4) (2013)
Qiulan Zhao, Jinjiang Yuan
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption. J. Sched. 16 (3) (2013)
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) (2013)
Ran Ma, Jinjiang Yuan
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. Inf. Process. Lett. 113 (17) (2013)
Ruifang Liu, Huicai Jia, Jinjiang Yuan
Tree with minimal Laplacian spectral radius and diameter n-4. Ars Comb. 109 (2013)
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 (2012)
Shisheng Li, Jinjiang Yuan
Unbounded parallel-batching scheduling with two competitive agents. J. Sched. 15 (5) (2012)
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. Discret. Appl. Math. 160 (7-8) (2012)
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) (2012)

Jinjiang Yuan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jinjiang Yuan