A local reductive elimination for the fill-in of graphs. - Jinjiang Yuan (Discret. Math., 1995)

The automorphism groups of circulant digraphs of degree 3. - Qiongxiang Huang; Jinjiang Yuan (Ars Comb., 1996)

Path-width and tree-width of the join of graphs. - Jinjiang Yuan (Ars Comb., 1996)

Harper-type lower bounds and the bandwidths of the compositions of graphs. - Sanming Zhou; Jinjiang Yuan (Discret. Math., 1998)

Induced matching extendable graphs. - Jinjiang Yuan (J. Graph Theory, 1998)

Bondage number of planar graphs. - Liying Kang; Jinjiang Yuan (Discret. Math., 2000)

Maximal IM-unextendable graphs. - Qin Wang 001; Jinjiang Yuan (Discret. Math., 2001)

Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (Inf. Process. Lett., 2002)

A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (Oper. Res. Lett., 2002)

Partition the vertices of a graph into induced matchings. - Jinjiang Yuan; Qin Wang 001 (Discret. Math., 2003)

On scheduling an unbounded batch machine. - Zhaohui Liu 001; Jinjiang Yuan; T. C. Edwin Cheng (Oper. Res. Lett., 2003)

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan; Zhaohui Liu 001 (Oper. Res. Lett., 2003)

The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (J. Sched., 2003)

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (J. Sched., 2003)

Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (J. Sched., 2003)

A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. - Jinjiang Yuan; A. F. Yang; T. C. Edwin Cheng (Eur. J. Oper. Res., 2004)

Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting. - Jinjiang Yuan; Sanming Zhou (J. Interconnect. Networks, 2004)

The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. - Jinjiang Yuan; Zhaohui Liu 001; C. T. Ng 001; T. C. Edwin Cheng (Theor. Comput. Sci., 2004)

Characterization of induced matching extendable graphs with 2n vertices and 3n-1 edges. - Ju Zhou; Jinjiang Yuan (Australas. J Comb., 2005)

Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. - T. C. Edwin Cheng; Jinjiang Yuan; A. F. Yang (Comput. Oper. Res., 2005)

4-regular claw-free IM-extendable graphs. - Qin Wang 001; Jinjiang Yuan (Discret. Math., 2005)

A proof of an inequality concerning k-restricted edge connectivity. - Zhao Zhang; Jinjiang Yuan (Discret. Math., 2005)

Single machine scheduling to minimize total weighted tardiness. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan; Zhaohui Liu 001 (Eur. J. Oper. Res., 2005)

Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria. - Jinjiang Yuan; Yixun Lin (Eur. J. Oper. Res., 2005)

A note on the scheduling with two families of jobs. - Jinjiang Yuan; Weiping Shang; Qi Feng (J. Sched., 2005)

A Note of Perfect Nonlinear Functions. - Xiyong Zhang; Hua Guo; Jinjiang Yuan (CANS, 2006)

Upper minus domination in a claw-free cubic graph. - Weiping Shang; Jinjiang Yuan (Discret. Math., 2006)

Partition the vertices of a graph into one independent set and one acyclic set. - Aifeng Yang; Jinjiang Yuan (Discret. Math., 2006)

A note on the complexity of the problem of two-agent scheduling on a single machine. - C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (J. Comb. Optim., 2006)

Approximation algorithms for shop scheduling problems with minsum objective: A correction. - Wenhua Li; Maurice Queyranne; Maxim Sviridenko; Jinjiang Yuan (J. Sched., 2006)

Single machine batch scheduling problem with family setup times and release dates to minimize makespan. - Jinjiang Yuan; Zhaohui Liu 001; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2006)

Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Theor. Comput. Sci., 2006)

Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan. - Jinjiang Yuan; Yundong Mu; Lingfa Lu; Wenhua Li (Asia Pac. J. Oper. Res., 2007)

On the vertex arboricity of planar graphs of diameter two. - Aifeng Yang; Jinjiang Yuan (Discret. Math., 2007)

Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. - Zhao Zhang; Jinjiang Yuan (Discret. Math., 2007)

The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. - Lingfa Lu; Jinjiang Yuan (Eur. J. Oper. Res., 2007)

NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time. - Jinjiang Yuan; T. C. Edwin Cheng; C. T. Ng 001 (Eur. J. Oper. Res., 2007)

Approximability of single machine scheduling with fixed jobs to minimize total completion time. - Jinjiang Yuan; Y. X. Lin; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2007)

Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. - Jinjiang Yuan; Yundong Mu (Eur. J. Oper. Res., 2007)

A note on the complexity of flow shop scheduling with transportation constraints. - Jinjiang Yuan; Ameur Soukhal; Youjun Chen; Lingfa Lu (Eur. J. Oper. Res., 2007)

A note on special optimal batching structures to minimize total weighted completion time. - Wenhua Li; Jinjiang Yuan; Yixun Lin (J. Comb. Optim., 2007)

Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem. - Jinjiang Yuan; Jian Ying Zhang; Sanming Zhou (J. Discrete Algorithms, 2007)

Online scheduling in a parallel batch processing system to minimize makespan using restarts. - Ruyan Fu; Ji Tian; Jinjiang Yuan; Yixun Lin (Theor. Comput. Sci., 2007)

Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. - Cheng He; Yixun Lin; Jinjiang Yuan (Theor. Comput. Sci., 2007)

On-line scheduling with delivery time on a single batch machine. - Ji Tian; Ruyan Fu; Jinjiang Yuan (Theor. Comput. Sci., 2007)

Single Machine Scheduling with Job Delivery to minimize makespan. - Lingfa Lu; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2008)

Single Machine Scheduling with Forbidden Intervals and Job Delivery Times. - Jinjiang Yuan; Lei Shi; Jinwen Ou (Asia Pac. J. Oper. Res., 2008)

Multi-agent scheduling on a single machine with max-form criteria. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Eur. J. Oper. Res., 2008)

Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time. - T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Eur. J. Oper. Res., 2008)

Single machine unbounded parallel-batch scheduling with forbidden intervals. - Jinjiang Yuan; Xianglai Qi; Lingfa Lu; Wenhua Li (Eur. J. Oper. Res., 2008)

On-line scheduling on a batch machine to minimize makespan with limited restarts. - Ruyan Fu; Ji Tian; Jinjiang Yuan; Cheng He (Oper. Res. Lett., 2008)

Unbounded parallel batch scheduling with job delivery to minimize makespan. - Lingfa Lu; Jinjiang Yuan (Oper. Res. Lett., 2008)

An inverse model for the most uniform problem. - Qin Wang 001; Jinjiang Yuan; Jianzhong Zhang 001 (Oper. Res. Lett., 2008)

Single machine scheduling with release dates and job delivery to minimize the makespan. - Lingfa Lu; Jinjiang Yuan; Liqi Zhang (Theor. Comput. Sci., 2008)

The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. - Lingfa Lu; Liqi Zhang; Jinjiang Yuan (Theor. Comput. Sci., 2008)

A best on-line algorithm for single machine scheduling with small delivery times. - Ji Tian; Ruyan Fu; Jinjiang Yuan (Theor. Comput. Sci., 2008)

Bounded single-machine parallel-batch scheduling with release dates and rejection. - Lingfa Lu; T. C. Edwin Cheng; Jinjiang Yuan; Liqi Zhang (Comput. Oper. Res., 2009)

Edge-deletable IM-extendable graphs with minimum number of edges. - Xiumei Wang; Jinjiang Yuan; Sujing Zhou (Discret. Math., 2009)

Single machine scheduling with release dates and rejection. - Liqi Zhang; Lingfa Lu; Jinjiang Yuan (Eur. J. Oper. Res., 2009)

A DP algorithm for minimizing makespan and total completion time on a series-batching machine. - Cheng He; Yixun Lin; Jinjiang Yuan (Inf. Process. Lett., 2009)

Online scheduling on unbounded parallel-batch machines to minimize the makespan. - Ji Tian; T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Inf. Process. Lett., 2009)

The weighted link ring loading problem. - Qingqin Nong; Jinjiang Yuan; Yixun Lin (J. Comb. Optim., 2009)

A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. - Jinjiang Yuan; Shisheng Li; Ji Tian; Ruyan Fu (J. Comb. Optim., 2009)

On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. - Ruyan Fu; Ji Tian; Jinjiang Yuan (J. Sched., 2009)

Scheduling with families of jobs and delivery coordination under job availability. - Shisheng Li; Jinjiang Yuan (Theor. Comput. Sci., 2009)

Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead. - Wenjie Li; Jinjiang Yuan; Jianfa Cao; Hailin Bu (Theor. Comput. Sci., 2009)

Single machine parallel-batch scheduling with deteriorating jobs. - Xianglai Qi; Shiguo Zhou; Jinjiang Yuan (Theor. Comput. Sci., 2009)

A best online algorithm for scheduling on two parallel batch machines. - Ji Tian; Ruyan Fu; Jinjiang Yuan (Theor. Comput. Sci., 2009)

Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion. - Cheng He; Yixun Lin; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2010)

A note on the single machine scheduling to minimize the number of tardy jobs with deadlines. - Cheng He; Yixun Lin; Jinjiang Yuan (Eur. J. Oper. Res., 2010)

Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. - Ruyan Fu; T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Inf. Process. Lett., 2010)

Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan. - Shisheng Li; Jinjiang Yuan (J. Comb. Optim., 2010)

Parallel-machine scheduling with deteriorating jobs and rejection. - Shisheng Li; Jinjiang Yuan (Theor. Comput. Sci., 2010)

Preemptive scheduling with simple linear deterioration on a single machine. - C. T. Ng 001; Shisheng Li; T. C. Edwin Cheng; Jinjiang Yuan (Theor. Comput. Sci., 2010)

Single-machine scheduling under the job rejection constraint. - Liqi Zhang; Lingfa Lu; Jinjiang Yuan (Theor. Comput. Sci., 2010)

Best semi-online algorithms for unbounded parallel batch scheduling. - Jinjiang Yuan; C. T. Ng 001; T. C. Edwin Cheng (Discret. Appl. Math., 2011)

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. - Shisheng Li; C. T. Ng 001; T. C. Edwin Cheng; Jinjiang Yuan (Eur. J. Oper. Res., 2011)

Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times. - Jianfa Cao; Jinjiang Yuan; Wenjie Li; Hailin Bu (Int. J. Syst. Sci., 2011)

Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time. - Wenhua Li; Jinjiang Yuan (Inf. Process. Lett., 2011)

Unbounded parallel-batch scheduling with family jobs and delivery coordination. - Shisheng Li; Jinjiang Yuan; Baoqiang Fan (Inf. Process. Lett., 2011)

An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. - Ji Tian; Ruyan Fu; Jinjiang Yuan (Inf. Process. Lett., 2011)

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. - Jinjiang Yuan; Ruyan Fu; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2011)

Online scheduling on unbounded parallel-batch machines with incompatible job families. - Ji Tian; T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Theor. Comput. Sci., 2011)

An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. - Ji Tian; T. C. E. Cheng; C. T. Ng 001; Jinjiang Yuan (Discret. Appl. Math., 2012)

Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs. - Wenjie Li; Zhenkun Zhang; Hailing Liu; Jinjiang Yuan (Inf. Process. Lett., 2012)

Unbounded parallel-batching scheduling with two competitive agents. - Shisheng Li; Jinjiang Yuan (J. Sched., 2012)

A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. - Junling Yuan; Wenhua Li; Jinjiang Yuan (Theor. Comput. Sci., 2012)

Tree with minimal Laplacian spectral radius and diameter n-4. - Ruifang Liu; Huicai Jia; Jinjiang Yuan (Ars Comb., 2013)

Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. - Ran Ma; Jinjiang Yuan (Inf. Process. Lett., 2013)

An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. - Ruyan Fu; T. C. E. Cheng; C. T. Ng 001; Jinjiang Yuan (Oper. Res. Lett., 2013)

Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. - Long Wan; Jinjiang Yuan (Oper. Res. Lett., 2013)

A note on reverse scheduling with maximum lateness objective. - S. S. Li; Peter Brucker; Chi To Ng 001; T. C. Edwin Cheng; Natalia V. Shakhlevich; Jinjiang Yuan (J. Sched., 2013)

Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption. - Qiulan Zhao; Jinjiang Yuan (J. Sched., 2013)

Batching Machine Scheduling with bicriteria: Maximum Cost and makespan. - Cheng He; Hao Lin; Jinjiang Yuan; Yundong Mu (Asia Pac. J. Oper. Res., 2014)

A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines. - Chengwen Jiao; Wenhua Li; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2014)

On the vertex-arboricity of K5-minor-free graphs of diameter 2. - Fei Huang 007; Xiumei Wang; Jinjiang Yuan (Discret. Math., 2014)

Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan. - Ruyan Fu; Ji Tian; Jinjiang Yuan; Ya Li (Inf. Process. Lett., 2014)

On matching cover of graphs. - Xiumei Wang; Xiaoxin Song; Jinjiang Yuan (Math. Program., 2014)

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 (Optim. Lett., 2014)

Online scheduling of incompatible unit-length job families with lookahead. - Wenhua Li; Jinjiang Yuan; Sufang Yang (Theor. Comput. Sci., 2014)

Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart. - Hailing Liu; Jinjiang Yuan (Theor. Comput. Sci., 2014)

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 (Theor. Comput. Sci., 2014)

Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan. - Wenhua Li; Jie Gao; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2015)

An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead. - Wenjie Li; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2015)

Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates. - Yuan Gao; Jinjiang Yuan (Discret. Appl. Math., 2015)

On Graphs with a Unique Perfect Matching. - Xiumei Wang; Weiping Shang; Jinjiang Yuan (Graphs Comb., 2015)

A note on unbounded parallel-batch scheduling. - Zhichao Geng; Jinjiang Yuan (Inf. Process. Lett., 2015)

A note on Pareto minimizing total completion time and maximum cost. - Yuan Gao; Jinjiang Yuan (Oper. Res. Lett., 2015)

A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints. - Long Wan; Jinjiang Yuan; Zhichao Geng (J. Sched., 2015)

Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. - Jinjiang Yuan; C. T. Ng 001; T. C. Edwin Cheng (J. Sched., 2015)

Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time. - Youjun Chen; Lingfa Lu; Jinjiang Yuan (Theor. Comput. Sci., 2015)

Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness. - Zhichao Geng; Jinjiang Yuan (Theor. Comput. Sci., 2015)

Single-machine batch scheduling with job processing time compatibility. - Shisheng Li; T. C. Edwin Cheng; C. T. Ng 001; Jinjiang Yuan (Theor. Comput. Sci., 2015)

Rescheduling with new orders and general maximum allowable time disruptions. - Qiulan Zhao; Lingfa Lu; Jinjiang Yuan (4OR, 2016)

Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. - Ran Ma; Jiping Tao; Jinjiang Yuan (Appl. Math. Comput., 2016)

Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost. - Long Wan; Jinjiang Yuan; Lijun Wei (Appl. Math. Comput., 2016)

Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness. - Qijia Liu; Jinjiang Yuan (J. Comb. Optim., 2016)

Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart. - Hailing Liu; Jinjiang Yuan; Wenjie Li (J. Comb. Optim., 2016)

LPT online strategy for parallel-machine scheduling with kind release times. - Wenjie Li; Jinjiang Yuan (Optim. Lett., 2016)

Unary NP-hardness of minimizing total weighted tardiness with generalized due dates. - Yuan Gao; Jinjiang Yuan (Oper. Res. Lett., 2016)

Two-machine open-shop scheduling with rejection to minimize the makespan. - Liqi Zhang; Lingfa Lu; Jinjiang Yuan (OR Spectr., 2016)

Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time. - Youjun Chen; Lingfa Lu; Jinjiang Yuan (Theor. Comput. Sci., 2016)

Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time. - Ji Tian; Qian Wang; Ruyan Fu; Jinjiang Yuan (Theor. Comput. Sci., 2016)

Semi-online hierarchical scheduling for $$l_p$$ l p -norm load balancing with buffer or rearrangements. - Xianglai Qi; Jinjiang Yuan (4OR, 2017)

Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs. - Qiulan Zhao; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2017)

A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost. - Xianglai Qi; Jinjiang Yuan (Comput. Ind. Eng., 2017)

Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. - Yuan Gao; Jinjiang Yuan (Discret. Optim., 2017)

Pareto optimization for the two-agent scheduling problems with linear non-increasing deterioration based on Internet of Things. - Long Wan; Lijun Wei; Naixue Xiong; Jinjiang Yuan; Jiacai Xiong (Future Gener. Comput. Syst., 2017)

An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities. - Ruyan Fu; Ji Tian; Shisheng Li; Jinjiang Yuan (J. Comb. Optim., 2017)

Online scheduling to minimize the total weighted completion time plus the rejection cost. - Ran Ma; Jinjiang Yuan (J. Comb. Optim., 2017)

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. - Jinjiang Yuan (J. Comb. Optim., 2017)

Unary NP-hardness of minimizing the number of tardy jobs with deadlines. - Jinjiang Yuan (J. Sched., 2017)

Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost. - Zhichao Geng; Jinjiang Yuan; Junling Yuan (Appl. Math. Comput., 2018)

Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery. - Qijia Liu; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2018)

Single-machine scheduling with operator non-availability to minimize total weighted completion time. - Long Wan; Jinjiang Yuan (Inf. Sci., 2018)

Complexities of four problems on two-agent scheduling. - Jinjiang Yuan (Optim. Lett., 2018)

Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead. - Chengwen Jiao; Jinjiang Yuan; Qi Feng (Asia Pac. J. Oper. Res., 2019)

Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing. - Xianglai Qi; Jinjiang Yuan (Asia Pac. J. Oper. Res., 2019)

Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles. - Xiaozheng Chen; Fei Huang 007; Jinjiang Yuan (Discret. Appl. Math., 2019)

On strong proper connection number of cubic graphs. - Fei Huang 007; Jinjiang Yuan (Discret. Appl. Math., 2019)

Single-machine scheduling with positional due indices and positional deadlines. - Rubing Chen; Jinjiang Yuan; Lingfa Lu (Discret. Optim., 2019)

A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. - Yuan Gao; Jinjiang Yuan; Chi To Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2019)

Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs. - Yuan Gao; Jinjiang Yuan (J. Comb. Optim., 2019)

A note on a two-agent scheduling problem related to the total weighted late work. - Yuan Zhang; Jinjiang Yuan (J. Comb. Optim., 2019)

Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time. - Hongjun Wei; Jinjiang Yuan (Oper. Res. Lett., 2019)

A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine. - Qiulan Zhao; Jinjiang Yuan (Oper. Res. Lett., 2019)

Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. - Rubing Chen; Jinjiang Yuan (J. Sched., 2019)

The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. - Rubing Chen; Jinjiang Yuan; Yuan Gao (J. Sched., 2019)

Unbounded parallel-batch scheduling with drop-line tasks. - Yuan Gao; Jinjiang Yuan; Zhigang Wei (J. Sched., 2019)

Paths and trails in edge-colored weighted graphs. - Runjie Miao; Jinjiang Yuan; Fei Huang 007 (Theor. Comput. Sci., 2019)

Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. - Rubing Chen; Jinjiang Yuan (4OR, 2020)

ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost. - Rubing Chen; Jinjiang Yuan; Zhichao Geng (Appl. Math. Comput., 2020)

Single-machine scheduling with maintenance activities and rejection. - Juan Zou; Jinjiang Yuan (Discret. Optim., 2020)

Even cycles and perfect matchings in claw-free plane graphs. - Shanshan Zhang; Xiumei Wang; Jinjiang Yuan (Discret. Math. Theor. Comput. Sci., 2020)

Scheduling with release dates and preemption to minimize multiple max-form objective functions. - Jinjiang Yuan; Chi To Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2020)

Bicriteria scheduling of equal length jobs on uniform parallel machines. - Qiulan Zhao; Jinjiang Yuan (J. Comb. Optim., 2020)

Single-machine scheduling with multi-agents to minimize total weighted late work. - Shi-Sheng Li; Jinjiang Yuan (J. Sched., 2020)

A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs. - Fei Huang 007; Shanshan Guo; Jinjiang Yuan (SIAM J. Discret. Math., 2020)

Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. - Rubing Chen; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Comput. Ind. Eng., 2021)

Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. - Rubing Chen; Jinjiang Yuan (Discret. Appl. Math., 2021)

Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. - Rubing Chen; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2021)

Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. - Ruyan He; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (J. Comb. Optim., 2021)

Single-machine online scheduling of jobs with non-delayed processing constraint. - Wenjie Li; Jinjiang Yuan (J. Comb. Optim., 2021)

A note on competing-agent Pareto-scheduling. - Yuan Gao; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Optim. Lett., 2021)

A note on the complexity of two supply chain scheduling problems. - Yuan Zhang; Jinjiang Yuan (J. Sched., 2021)

Scheduling to tradeoff between the number and the length of accepted jobs. - Qiulan Zhao; Jinjiang Yuan (Theor. Comput. Sci., 2021)

Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. - Yuan Gao; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (4OR, 2022)

Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs. - Rubing Chen; Ruyan He; Jinjiang Yuan (Comput. Ind. Eng., 2022)

Improved sufficient conditions for k-leaf-connected graphs. - Guoyan Ao; Ruifang Liu; Jinjiang Yuan; Rao Li (Discret. Appl. Math., 2022)

Bicritical graphs without removable edges. - Yipei Zhang; Xiumei Wang; Jinjiang Yuan (Discret. Appl. Math., 2022)

Properly colored 2-factors of edge-colored complete bipartite graphs. - Shanshan Guo; Fei Huang 007; Jinjiang Yuan (Discret. Math., 2022)

Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three. - Luyi Li; Fei Huang 007; Jinjiang Yuan (Discret. Math., 2022)

On cycle-nice claw-free graphs. - Shanshan Zhang; Xiumei Wang; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Math., 2022)

Pareto-scheduling of two competing agents with their own equal processing times. - Rubing Chen; Zhichao Geng; Lingfa Lu; Jinjiang Yuan; Yuan Zhang (Eur. J. Oper. Res., 2022)

A note on LP-based approximation algorithms for capacitated facility location problem. - Runjie Miao; Jinjiang Yuan (Theor. Comput. Sci., 2022)

The Aα-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree). - Qixuan Yuan; Ruifang Liu; Jinjiang Yuan (Discret. Optim., 2023)

Spectral radius and spanning trees of graphs. - Guoyan Ao; Ruifang Liu; Jinjiang Yuan (Discret. Math., 2023)

Single-machine scheduling of multiple projects with controllable processing times. - Zhichao Geng; Jinjiang Yuan (Eur. J. Oper. Res., 2023)

Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. - Rubing Chen; Yuan Gao; Zhichao Geng; Jinjiang Yuan (Int. J. Prod. Res., 2023)

Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs. - Shanshan Guo; Fei Huang 007; Jinjiang Yuan (Graphs Comb., 2023)

Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs. - Shanshan Guo; Fei Huang 007; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Appl. Math., 2024)

The spectral radius of H2k-free graphs. - Qixuan Yuan; Ruifang Liu; Jinjiang Yuan (Appl. Math. Comput., 2024)

Single-machine primary-secondary scheduling with total tardiness being the primary criterion. - Qiulan Zhao; Jinjiang Yuan (J. Sched., 2024)

Sufficient conditions for k-factors and spanning trees of graphs. - Guoyan Ao; Ruifang Liu; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Appl. Math., 2025)

Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time. - Hongjun Wei; Yuan Gao; Jinjiang Yuan (Discret. Appl. Math., 2025)

Claw-free minimal matching covered graphs. - Yipei Zhang; Xiumei Wang; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Appl. Math., 2025)

Properly colored even cycles in edge-colored complete balanced bipartite graphs. - Shanshan Guo; Fei Huang 007; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Discret. Math., 2025)

Single-machine preemptive scheduling with assignable due dates or assignable weights to minimize total weighted late work. - Rubing Chen; Xinyu Dong; Jinjiang Yuan; C. T. Ng 001; T. C. E. Cheng (Eur. J. Oper. Res., 2025)

Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan. - Han Zhang; Lingfa Lu; Jinjiang Yuan (J. Comb. Optim., 2025)

Removable edges in near-bipartite bricks. - Yipei Zhang; Fuliang Lu; Xiumei Wang; Jinjiang Yuan (J. Graph Theory, 2025)

Even cycles and perfect matchings in planar graphs. - Shanshan Zhang; Xiumei Wang; Jinjiang Yuan; C. T. Daniel Ng; T. C. E. Cheng (Discret. Appl. Math., 2026)