Jinjiang Yuan

194 papers B 1Journal 193
YearRankTypeTitle / Venue / Authors
2026 J jnl
Even cycles and perfect matchings in planar graphs.
Discret. Appl. Math.
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Daniel Ng, T. C. E. Cheng
2026 J jnl
Spectral extremal problem on all (a, b, k)-critical graphs.
Comput. Appl. Math.
Qixuan Yuan, Ruifang Liu, Jinjiang Yuan
2026 J jnl
Spectral radius and critical covered graphs.
Comput. Appl. Math.
Qixuan Yuan, Ruifang Liu, Jinjiang Yuan
2025 J jnl
Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs.
J. Comb. Optim.
Jing Zhang, Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Claw-free minimal matching covered graphs.
Discret. Appl. Math.
Yipei Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan.
J. Comb. Optim.
Han Zhang, Lingfa Lu, Jinjiang Yuan
2025 J jnl
Properly colored even cycles in edge-colored complete balanced bipartite graphs.
Discret. Math.
Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Removable edges in near-bipartite bricks.
J. Graph Theory
Yipei Zhang, Fuliang Lu, Xiumei Wang, Jinjiang Yuan
2025 J jnl
Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work.
Eur. J. Oper. Res.
Rubing Chen, Xinyu Dong, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Sufficient conditions for k-factors and spanning trees of graphs.
Discret. Appl. Math.
Guoyan Ao, Ruifang Liu, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2025 J jnl
Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time.
Discret. Appl. Math.
Hongjun Wei, Yuan Gao, Jinjiang Yuan
2024 J jnl
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs.
Discret. Appl. Math.
Shanshan Guo, Fei Huang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2024 J jnl
Single-machine primary-secondary scheduling with total tardiness being the primary criterion.
J. Sched.
Qiulan Zhao, Jinjiang Yuan
2024 J jnl
The spectral radius of
Appl. Math. Comput.
Qixuan Yuan, Ruifang Liu, Jinjiang Yuan
2023 J jnl
Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs.
Graphs Comb.
Shanshan Guo, Fei Huang, Jinjiang Yuan
2023 J jnl
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work.
Int. J. Prod. Res.
Rubing Chen, Yuan Gao, Zhichao Geng, Jinjiang Yuan
2023 J jnl
Single-machine scheduling of multiple projects with controllable processing times.
Eur. J. Oper. Res.
Zhichao Geng, Jinjiang Yuan
2023 J jnl
Spectral radius and spanning trees of graphs.
Discret. Math.
Guoyan Ao, Ruifang Liu, Jinjiang Yuan
2023 J jnl
The Aα-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree).
Discret. Optim.
Qixuan Yuan, Ruifang Liu, Jinjiang Yuan
2022 J jnl
A note on LP-based approximation algorithms for capacitated facility location problem.
Theor. Comput. Sci.
Runjie Miao, Jinjiang Yuan
2022 J jnl
Bicritical graphs without removable edges.
Discret. Appl. Math.
Yipei Zhang, Xiumei Wang, Jinjiang Yuan
2022 J jnl
Improved sufficient conditions for k-leaf-connected graphs.
Discret. Appl. Math.
Guoyan Ao, Ruifang Liu, Jinjiang Yuan, Rao Li
2022 J jnl
On cycle-nice claw-free graphs.
Discret. Math.
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2022 J jnl
Pareto-scheduling of two competing agents with their own equal processing times.
Eur. J. Oper. Res.
Rubing Chen, Zhichao Geng, Lingfa Lu, Jinjiang Yuan, Yuan Zhang
2022 J jnl
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost.
4OR
Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2022 J jnl
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs.
Comput. Ind. Eng.
Rubing Chen, Ruyan He, Jinjiang Yuan
2022 J jnl
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three.
Discret. Math.
Luyi Li, Fei Huang, Jinjiang Yuan
2022 J jnl
Properly colored 2-factors of edge-colored complete bipartite graphs.
Discret. Math.
Shanshan Guo, Fei Huang, Jinjiang Yuan
2021 J jnl
A note on competing-agent Pareto-scheduling.
Optim. Lett.
Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2021 J jnl
A note on the complexity of two supply chain scheduling problems.
J. Sched.
Yuan Zhang, Jinjiang Yuan
2021 J jnl
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.
Comput. Ind. Eng.
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2021 J jnl
Scheduling to tradeoff between the number and the length of accepted jobs.
Theor. Comput. Sci.
Qiulan Zhao, Jinjiang Yuan
2021 J jnl
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion.
Eur. J. Oper. Res.
Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2021 J jnl
Single-machine online scheduling of jobs with non-delayed processing constraint.
J. Comb. Optim.
Wenjie Li, Jinjiang Yuan
2021 J jnl
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work.
J. Comb. Optim.
Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng
2021 J jnl
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines.
Discret. Appl. Math.
Rubing Chen, Jinjiang Yuan
2020 J jnl
A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs.
SIAM J. Discret. Math.
Fei Huang, Shanshan Guo, Jinjiang Yuan
2020 J jnl
Bicriteria scheduling of equal length jobs on uniform parallel machines.
J. Comb. Optim.
Qiulan Zhao, Jinjiang Yuan
2020 J jnl
Even cycles and perfect matchings in claw-free plane graphs.
Discret. Math. Theor. Comput. Sci.
Shanshan Zhang, Xiumei Wang, Jinjiang Yuan
2020 J jnl
ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost.
Appl. Math. Comput.
Rubing Chen, Jinjiang Yuan, Zhichao Geng
2020 J jnl
Scheduling with release dates and preemption to minimize multiple max-form objective functions.
Eur. J. Oper. Res.
Jinjiang Yuan, Chi To Ng, T. C. E. Cheng
2020 J jnl
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices.
4OR
Rubing Chen, Jinjiang Yuan
2020 J jnl
Single-machine scheduling with maintenance activities and rejection.
Discret. Optim.
Juan Zou, Jinjiang Yuan
2020 J jnl
Single-machine scheduling with multi-agents to minimize total weighted late work.
J. Sched.
Shi-Sheng Li, Jinjiang Yuan
2019 J jnl
A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan.
Eur. J. Oper. Res.
Yuan Gao, Jinjiang Yuan, Chi To Ng, T. C. E. Cheng
2019 J jnl
A note on a two-agent scheduling problem related to the total weighted late work.
J. Comb. Optim.
Yuan Zhang, Jinjiang Yuan
2019 J jnl
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine.
Oper. Res. Lett.
Qiulan Zhao, Jinjiang Yuan
2019 J jnl
On strong proper connection number of cubic graphs.
Discret. Appl. Math.
Fei Huang, Jinjiang Yuan
2019 J jnl
Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead.
Asia Pac. J. Oper. Res.
Chengwen Jiao, Jinjiang Yuan, Qi Feng
2019 J jnl
Paths and trails in edge-colored weighted graphs.
Theor. Comput. Sci.
Runjie Miao, Jinjiang Yuan, Fei Huang
2019 J jnl
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles.
Discret. Appl. Math.
Xiaozheng Chen, Fei Huang, Jinjiang Yuan
2019 J jnl
Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing.
Asia Pac. J. Oper. Res.
Xianglai Qi, Jinjiang Yuan
2019 J jnl
Single-machine scheduling with positional due indices and positional deadlines.
Discret. Optim.
Rubing Chen, Jinjiang Yuan, Lingfa Lu
2019 J jnl
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs.
J. Sched.
Rubing Chen, Jinjiang Yuan, Yuan Gao
2019 J jnl
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time.
Oper. Res. Lett.
Hongjun Wei, Jinjiang Yuan
2019 J jnl
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines.
J. Sched.
Rubing Chen, Jinjiang Yuan
2019 J jnl
Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs.
J. Comb. Optim.
Yuan Gao, Jinjiang Yuan
2019 J jnl
Unbounded parallel-batch scheduling with drop-line tasks.
J. Sched.
Yuan Gao, Jinjiang Yuan, Zhigang Wei
2018 J jnl
Complexities of four problems on two-agent scheduling.
Optim. Lett.
Jinjiang Yuan
2018 J jnl
Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery.
Asia Pac. J. Oper. Res.
Qijia Liu, Jinjiang Yuan
2018 J jnl
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost.
Appl. Math. Comput.
Zhichao Geng, Jinjiang Yuan, Junling Yuan
2018 J jnl
Single-machine scheduling with operator non-availability to minimize total weighted completion time.
Inf. Sci.
Long Wan, Jinjiang Yuan
2017 J jnl
A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost.
Comput. Ind. Eng.
Xianglai Qi, Jinjiang Yuan
2017 J jnl
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities.
J. Comb. Optim.
Ruyan Fu, Ji Tian, Shisheng Li, Jinjiang Yuan
2017 J jnl
Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints.
Discret. Optim.
Yuan Gao, Jinjiang Yuan
2017 J jnl
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.
Jinjiang Yuan
2017 J jnl
Online scheduling to minimize the total weighted completion time plus the rejection cost.
J. Comb. Optim.
Ran Ma, Jinjiang Yuan
2017 J jnl
Pareto optimization for the two-agent scheduling problems with linear non-increasing deterioration based on Internet of Things.
Future Gener. Comput. Syst.
Long Wan, Lijun Wei, Naixue Xiong, Jinjiang Yuan, Jiacai Xiong
2017 J jnl
Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs.
Asia Pac. J. Oper. Res.
Qiulan Zhao, Jinjiang Yuan
2017 J jnl
Semi-online hierarchical scheduling for $$l_p$$ l p -norm load balancing with buffer or rearrangements.
4OR
Xianglai Qi, Jinjiang Yuan
2017 J jnl
Unary NP-hardness of minimizing the number of tardy jobs with deadlines.
J. Sched.
Jinjiang Yuan
2016 J jnl
LPT online strategy for parallel-machine scheduling with kind release times.
Optim. Lett.
Wenjie Li, Jinjiang Yuan
2016 J jnl
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart.
J. Comb. Optim.
Hailing Liu, Jinjiang Yuan, Wenjie Li
2016 J jnl
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time.
Theor. Comput. Sci.
Ji Tian, Qian Wang, Ruyan Fu, Jinjiang Yuan
2016 J jnl
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time.
Appl. Math. Comput.
Ran Ma, Jiping Tao, Jinjiang Yuan
2016 J jnl
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness.
J. Comb. Optim.
Qijia Liu, Jinjiang Yuan
2016 J jnl
Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost.
Appl. Math. Comput.
Long Wan, Jinjiang Yuan, Lijun Wei
2016 J jnl
Rescheduling with new orders and general maximum allowable time disruptions.
4OR
Qiulan Zhao, Lingfa Lu, Jinjiang Yuan
2016 J jnl
Two-machine open-shop scheduling with rejection to minimize the makespan.
OR Spectr.
Liqi Zhang, Lingfa Lu, Jinjiang Yuan
2016 J jnl
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time.
Theor. Comput. Sci.
Youjun Chen, Lingfa Lu, Jinjiang Yuan
2016 J jnl
Unary NP-hardness of minimizing total weighted tardiness with generalized due dates.
Oper. Res. Lett.
Yuan Gao, Jinjiang Yuan
2015 J jnl
A note on Pareto minimizing total completion time and maximum cost.
Oper. Res. Lett.
Yuan Gao, Jinjiang Yuan
2015 J jnl
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints.
J. Sched.
Long Wan, Jinjiang Yuan, Zhichao Geng
2015 J jnl
A note on unbounded parallel-batch scheduling.
Inf. Process. Lett.
Zhichao Geng, Jinjiang Yuan
2015 J jnl
An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead.
Asia Pac. J. Oper. Res.
Wenjie Li, Jinjiang Yuan
2015 J jnl
On Graphs with a Unique Perfect Matching.
Graphs Comb.
Xiumei Wang, Weiping Shang, Jinjiang Yuan
2015 J jnl
Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan.
Asia Pac. J. Oper. Res.
Wenhua Li, Jie Gao, Jinjiang Yuan
2015 J jnl
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness.
Theor. Comput. Sci.
Zhichao Geng, Jinjiang Yuan
2015 J jnl
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time.
Theor. Comput. Sci.
Youjun Chen, Lingfa Lu, Jinjiang Yuan
2015 J jnl
Single-machine batch scheduling with job processing time compatibility.
Theor. Comput. Sci.
Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2015 J jnl
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness.
J. Sched.
Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng
2015 J jnl
Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates.
Discret. Appl. Math.
Yuan Gao, Jinjiang Yuan
2014 J jnl
A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines.
Asia Pac. J. Oper. Res.
Chengwen Jiao, Wenhua Li, Jinjiang Yuan
2014 J jnl
Batching Machine Scheduling with bicriteria: Maximum Cost and makespan.
Asia Pac. J. Oper. Res.
Cheng He, Hao Lin, Jinjiang Yuan, Yundong Mu
2014 J jnl
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs.
Optim. Lett.
Wenjie Li, Jinjiang Yuan
2014 J jnl
On matching cover of graphs.
Math. Program.
Xiumei Wang, Xiaoxin Song, Jinjiang Yuan
2014 J jnl
On the vertex-arboricity of K
Discret. Math.
Fei Huang, Xiumei Wang, Jinjiang Yuan
2014 J jnl
Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart.
Theor. Comput. Sci.
Hailing Liu, Jinjiang Yuan
2014 J jnl
Online scheduling of incompatible unit-length job families with lookahead.
Theor. Comput. Sci.
Wenhua Li, Jinjiang Yuan, Sufang Yang
2014 J jnl
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan.
Inf. Process. Lett.
Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li
2014 J jnl
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.
Long Wan, Ran Ma, Jinjiang Yuan
2013 J jnl
A note on reverse scheduling with maximum lateness objective.
J. Sched.
Shi-Sheng Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, Natalia V. Shakhlevich, Jinjiang Yuan
2013 J jnl
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.
Oper. Res. Lett.
Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan
2013 J jnl
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.
Ran Ma, Jinjiang Yuan
2013 J jnl
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption.
J. Sched.
Qiulan Zhao, Jinjiang Yuan
2013 J jnl
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard.
Oper. Res. Lett.
Long Wan, Jinjiang Yuan
2013 J jnl
Tree with minimal Laplacian spectral radius and diameter n-4.
Ars Comb.
Ruifang Liu, Huicai Jia, Jinjiang Yuan
2012 J jnl
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints.
Theor. Comput. Sci.
Junling Yuan, Wenhua Li, Jinjiang Yuan
2012 J jnl
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.
Discret. Appl. Math.
Ji Tian, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan
2012 J jnl
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs.
Inf. Process. Lett.
Wenjie Li, Zhenkun Zhang, Hailing Liu, Jinjiang Yuan
2012 J jnl
Unbounded parallel-batching scheduling with two competitive agents.
J. Sched.
Shisheng Li, Jinjiang Yuan
2011 J jnl
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.
J. Sched.
Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng
2011 J jnl
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.
Inf. Process. Lett.
Ji Tian, Ruyan Fu, Jinjiang Yuan
2011 J jnl
Best semi-online algorithms for unbounded parallel batch scheduling.
Discret. Appl. Math.
Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng
2011 J jnl
Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times.
Int. J. Syst. Sci.
Jianfa Cao, Jinjiang Yuan, Wenjie Li, Hailin Bu
2011 J jnl
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time.
Inf. Process. Lett.
Wenhua Li, Jinjiang Yuan
2011 J jnl
Online scheduling on unbounded parallel-batch machines with incompatible job families.
Theor. Comput. Sci.
Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2011 J jnl
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.
Eur. J. Oper. Res.
Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2011 J jnl
Unbounded parallel-batch scheduling with family jobs and delivery coordination.
Inf. Process. Lett.
Shisheng Li, Jinjiang Yuan, Baoqiang Fan
2010 J jnl
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines.
Eur. J. Oper. Res.
Cheng He, Yixun Lin, Jinjiang Yuan
2010 J jnl
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.
Inf. Process. Lett.
Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2010 J jnl
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan.
J. Comb. Optim.
Shisheng Li, Jinjiang Yuan
2010 J jnl
Parallel-machine scheduling with deteriorating jobs and rejection.
Theor. Comput. Sci.
Shisheng Li, Jinjiang Yuan
2010 J jnl
Preemptive scheduling with simple linear deterioration on a single machine.
Theor. Comput. Sci.
C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan
2010 J jnl
Single-machine scheduling under the job rejection constraint.
Theor. Comput. Sci.
Liqi Zhang, Lingfa Lu, Jinjiang Yuan
2010 J jnl
Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion.
Asia Pac. J. Oper. Res.
Cheng He, Yixun Lin, Jinjiang Yuan
2009 J jnl
A DP algorithm for minimizing makespan and total completion time on a series-batching machine.
Inf. Process. Lett.
Cheng He, Yixun Lin, Jinjiang Yuan
2009 J jnl
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.
J. Comb. Optim.
Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu
2009 J jnl
A best online algorithm for scheduling on two parallel batch machines.
Theor. Comput. Sci.
Ji Tian, Ruyan Fu, Jinjiang Yuan
2009 J jnl
Bounded single-machine parallel-batch scheduling with release dates and rejection.
Comput. Oper. Res.
Lingfa Lu, T. C. Edwin Cheng, Jinjiang Yuan, Liqi Zhang
2009 J jnl
Edge-deletable IM-extendable graphs with minimum number of edges.
Discret. Math.
Xiumei Wang, Jinjiang Yuan, Sujing Zhou
2009 J jnl
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.
J. Sched.
Ruyan Fu, Ji Tian, Jinjiang Yuan
2009 J jnl
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead.
Theor. Comput. Sci.
Wenjie Li, Jinjiang Yuan, Jianfa Cao, Hailin Bu
2009 J jnl
Online scheduling on unbounded parallel-batch machines to minimize the makespan.
Inf. Process. Lett.
Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2009 J jnl
Scheduling with families of jobs and delivery coordination under job availability.
Theor. Comput. Sci.
Shisheng Li, Jinjiang Yuan
2009 J jnl
Single machine parallel-batch scheduling with deteriorating jobs.
Theor. Comput. Sci.
Xianglai Qi, Shiguo Zhou, Jinjiang Yuan
2009 J jnl
Single machine scheduling with release dates and rejection.
Eur. J. Oper. Res.
Liqi Zhang, Lingfa Lu, Jinjiang Yuan
2009 J jnl
The weighted link ring loading problem.
J. Comb. Optim.
Qingqin Nong, Jinjiang Yuan, Yixun Lin
2008 J jnl
A best on-line algorithm for single machine scheduling with small delivery times.
Theor. Comput. Sci.
Ji Tian, Ruyan Fu, Jinjiang Yuan
2008 J jnl
An inverse model for the most uniform problem.
Oper. Res. Lett.
Qin Wang, Jinjiang Yuan, Jianzhong Zhang
2008 J jnl
Multi-agent scheduling on a single machine with max-form criteria.
Eur. J. Oper. Res.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2008 J jnl
On-line scheduling on a batch machine to minimize makespan with limited restarts.
Oper. Res. Lett.
Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He
2008 J jnl
Single Machine Scheduling with Forbidden Intervals and Job Delivery Times.
Asia Pac. J. Oper. Res.
Jinjiang Yuan, Lei Shi, Jinwen Ou
2008 J jnl
Single Machine Scheduling with Job Delivery to minimize makespan.
Asia Pac. J. Oper. Res.
Lingfa Lu, Jinjiang Yuan
2008 J jnl
Single machine scheduling with release dates and job delivery to minimize the makespan.
Theor. Comput. Sci.
Lingfa Lu, Jinjiang Yuan, Liqi Zhang
2008 J jnl
Single machine unbounded parallel-batch scheduling with forbidden intervals.
Eur. J. Oper. Res.
Jinjiang Yuan, Xianglai Qi, Lingfa Lu, Wenhua Li
2008 J jnl
Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time.
Eur. J. Oper. Res.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2008 J jnl
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan.
Theor. Comput. Sci.
Lingfa Lu, Liqi Zhang, Jinjiang Yuan
2008 J jnl
Unbounded parallel batch scheduling with job delivery to minimize makespan.
Oper. Res. Lett.
Lingfa Lu, Jinjiang Yuan
2007 J jnl
A note on special optimal batching structures to minimize total weighted completion time.
J. Comb. Optim.
Wenhua Li, Jinjiang Yuan, Yixun Lin
2007 J jnl
A note on the complexity of flow shop scheduling with transportation constraints.
Eur. J. Oper. Res.
Jinjiang Yuan, Ameur Soukhal, Youjun Chen, Lingfa Lu
2007 J jnl
Approximability of single machine scheduling with fixed jobs to minimize total completion time.
Eur. J. Oper. Res.
Jinjiang Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng
2007 J jnl
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan.
Theor. Comput. Sci.
Cheng He, Yixun Lin, Jinjiang Yuan
2007 J jnl
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal.
Discret. Math.
Zhao Zhang, Jinjiang Yuan
2007 J jnl
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.
Eur. J. Oper. Res.
Jinjiang Yuan, T. C. Edwin Cheng, C. T. Ng
2007 J jnl
On the vertex arboricity of planar graphs of diameter two.
Discret. Math.
Aifeng Yang, Jinjiang Yuan
2007 J jnl
On-line scheduling with delivery time on a single batch machine.
Theor. Comput. Sci.
Ji Tian, Ruyan Fu, Jinjiang Yuan
2007 J jnl
Online scheduling in a parallel batch processing system to minimize makespan using restarts.
Theor. Comput. Sci.
Ruyan Fu, Ji Tian, Jinjiang Yuan, Yixun Lin
2007 J jnl
Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan.
Asia Pac. J. Oper. Res.
Jinjiang Yuan, Yundong Mu, Lingfa Lu, Wenhua Li
2007 J jnl
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption.
Eur. J. Oper. Res.
Jinjiang Yuan, Yundong Mu
2007 J jnl
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem.
J. Discrete Algorithms
Jinjiang Yuan, Jian Ying Zhang, Sanming Zhou
2007 J jnl
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard.
Eur. J. Oper. Res.
Lingfa Lu, Jinjiang Yuan
2006 B conf
A Note of Perfect Nonlinear Functions.
CANS
Xiyong Zhang, Hua Guo, Jinjiang Yuan
2006 J jnl
A note on the complexity of the problem of two-agent scheduling on a single machine.
J. Comb. Optim.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2006 J jnl
Approximation algorithms for shop scheduling problems with minsum objective: A correction.
J. Sched.
Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan
2006 J jnl
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.
Theor. Comput. Sci.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2006 J jnl
Partition the vertices of a graph into one independent set and one acyclic set.
Discret. Math.
Aifeng Yang, Jinjiang Yuan
2006 J jnl
Single machine batch scheduling problem with family setup times and release dates to minimize makespan.
J. Sched.
Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
2006 J jnl
Upper minus domination in a claw-free cubic graph.
Discret. Math.
Weiping Shang, Jinjiang Yuan
2005 J jnl
4-regular claw-free IM-extendable graphs.
Discret. Math.
Qin Wang, Jinjiang Yuan
2005 J jnl
A note on the scheduling with two families of jobs.
J. Sched.
Jinjiang Yuan, Weiping Shang, Qi Feng
2005 J jnl
A proof of an inequality concerning
Discret. Math.
Zhao Zhang, Jinjiang Yuan
2005 J jnl
Characterization of induced matching extendable graphs with 2n vertices and 3n-1 edges.
Australas. J Comb.
Ju Zhou, Jinjiang Yuan
2005 J jnl
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times.
Comput. Oper. Res.
T. C. Edwin Cheng, Jinjiang Yuan, A. F. Yang
2005 J jnl
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria.
Eur. J. Oper. Res.
Jinjiang Yuan, Yixun Lin
2005 J jnl
Single machine scheduling to minimize total weighted tardiness.
Eur. J. Oper. Res.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu
2004 J jnl
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times.
Eur. J. Oper. Res.
Jinjiang Yuan, A. F. Yang, T. C. Edwin Cheng
2004 J jnl
Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.
J. Interconnect. Networks
Jinjiang Yuan, Sanming Zhou
2004 J jnl
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
Theor. Comput. Sci.
Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng
2003 J jnl
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs.
J. Sched.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2003 J jnl
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs.
J. Sched.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2003 J jnl
On scheduling an unbounded batch machine.
Oper. Res. Lett.
Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng
2003 J jnl
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
Oper. Res. Lett.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan, Zhaohui Liu
2003 J jnl
Partition the vertices of a graph into induced matchings.
Discret. Math.
Jinjiang Yuan, Qin Wang
2003 J jnl
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard.
J. Sched.
T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan
2002 J jnl
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.
Oper. Res. Lett.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2002 J jnl
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
Inf. Process. Lett.
C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan
2001 J jnl
Maximal IM-unextendable graphs.
Discret. Math.
Qin Wang, Jinjiang Yuan
2000 J jnl
Bondage number of planar graphs.
Discret. Math.
Liying Kang, Jinjiang Yuan
1998 J jnl
Harper-type lower bounds and the bandwidths of the compositions of graphs.
Discret. Math.
Sanming Zhou, Jinjiang Yuan
1998 J jnl
Induced matching extendable graphs.
J. Graph Theory
Jinjiang Yuan
1996 J jnl
Path-width and tree-width of the join of graphs.
Ars Comb.
Jinjiang Yuan
1996 J jnl
The automorphism groups of circulant digraphs of degree 3.
Ars Comb.
Qiongxiang Huang, Jinjiang Yuan
1995 J jnl
A local reductive elimination for the fill-in of graphs.
Discret. Math.
Jinjiang Yuan