Jinjiang Yuan
Orcid: 0000-0002-9814-615X
According to our database1,
Jinjiang Yuan
authored at least 183 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Single-machine primary-secondary scheduling with total tardiness being the primary criterion.
J. Sched., June, 2024
Appl. Math. Comput., May, 2024
Discret. Appl. Math., March, 2024
2023
Graphs Comb., December, 2023
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work.
Int. J. Prod. Res., November, 2023
Eur. J. Oper. Res., August, 2023
The Aα-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree).
Discret. Optim., February, 2023
2022
A note on LP-based approximation algorithms for capacitated facility location problem.
Theor. Comput. Sci., 2022
Eur. J. Oper. Res., 2022
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three.
Discret. Math., 2022
Discret. Math., 2022
Discret. Appl. Math., 2022
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs.
Comput. Ind. Eng., 2022
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost.
4OR, 2022
2021
Theor. Comput. Sci., 2021
J. Comb. Optim., 2021
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work.
J. Comb. Optim., 2021
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion.
Eur. J. Oper. Res., 2021
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines.
Discret. Appl. Math., 2021
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption.
Comput. Ind. Eng., 2021
2020
SIAM J. Discret. Math., 2020
J. Sched., 2020
J. Comb. Optim., 2020
Scheduling with release dates and preemption to minimize multiple max-form objective functions.
Eur. J. Oper. Res., 2020
Discret. Math. Theor. Comput. Sci., 2020
Discret. Optim., 2020
ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost.
Appl. Math. Comput., 2020
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices.
4OR, 2020
2019
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs.
J. Sched., 2019
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines.
J. Sched., 2019
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine.
Oper. Res. Lett., 2019
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time.
Oper. Res. Lett., 2019
J. Comb. Optim., 2019
Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs.
J. Comb. Optim., 2019
A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan.
Eur. J. Oper. Res., 2019
Discret. Optim., 2019
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles.
Discret. Appl. Math., 2019
Asia Pac. J. Oper. Res., 2019
Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead.
Asia Pac. J. Oper. Res., 2019
2018
Single-machine scheduling with operator non-availability to minimize total weighted completion time.
Inf. Sci., 2018
Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery.
Asia Pac. J. Oper. Res., 2018
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost.
Appl. Math. Comput., 2018
2017
J. Sched., 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.
J. Comb. Optim., 2017
Online scheduling to minimize the total weighted completion time plus the rejection cost.
J. Comb. Optim., 2017
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities.
J. Comb. Optim., 2017
Pareto optimization for the two-agent scheduling problems with linear non-increasing deterioration based on Internet of Things.
Future Gener. Comput. Syst., 2017
Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints.
Discret. Optim., 2017
A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost.
Comput. Ind. Eng., 2017
Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs.
Asia Pac. J. Oper. Res., 2017
Semi-online hierarchical scheduling for $$l_p$$ l p -norm load balancing with buffer or rearrangements.
4OR, 2017
2016
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time.
Theor. Comput. Sci., 2016
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time.
Theor. Comput. Sci., 2016
OR Spectr., 2016
Oper. Res. Lett., 2016
Optim. Lett., 2016
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart.
J. Comb. Optim., 2016
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness.
J. Comb. Optim., 2016
Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost.
Appl. Math. Comput., 2016
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time.
Appl. Math. Comput., 2016
4OR, 2016
2015
Theor. Comput. Sci., 2015
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness.
Theor. Comput. Sci., 2015
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time.
Theor. Comput. Sci., 2015
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness.
J. Sched., 2015
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints.
J. Sched., 2015
Oper. Res. Lett., 2015
Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates.
Discret. Appl. Math., 2015
An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead.
Asia Pac. J. Oper. Res., 2015
Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan.
Asia Pac. J. Oper. Res., 2015
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.
Theor. Comput. Sci., 2014
Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart.
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs.
Optim. Lett., 2014
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan.
Inf. Process. Lett., 2014
Discret. Math., 2014
A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines.
Asia Pac. J. Oper. Res., 2014
Asia Pac. J. Oper. Res., 2014
2013
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption.
J. Sched., 2013
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard.
Oper. Res. Lett., 2013
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan.
Oper. Res. Lett., 2013
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., 2013
Tree with minimal Laplacian spectral radius and diameter n-4.
Ars Comb., 2013
2012
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints.
Theor. Comput. Sci., 2012
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs.
Inf. Process. Lett., 2012
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.
Discret. Appl. Math., 2012
2011
Online scheduling on unbounded parallel-batch machines with incompatible job families.
Theor. Comput. Sci., 2011
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.
J. Sched., 2011
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.
Inf. Process. Lett., 2011
Inf. Process. Lett., 2011
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time.
Inf. Process. Lett., 2011
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., 2011
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.
Eur. J. Oper. Res., 2011
Discret. Appl. Math., 2011
2010
Theor. Comput. Sci., 2010
Theor. Comput. Sci., 2010
Theor. Comput. Sci., 2010
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan.
J. Comb. Optim., 2010
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.
Inf. Process. Lett., 2010
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines.
Eur. J. Oper. Res., 2010
Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion.
Asia Pac. J. Oper. Res., 2010
2009
Theor. Comput. Sci., 2009
Theor. Comput. Sci., 2009
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead.
Theor. Comput. Sci., 2009
Theor. Comput. Sci., 2009
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.
J. Sched., 2009
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.
J. Comb. Optim., 2009
Inf. Process. Lett., 2009
A DP algorithm for minimizing makespan and total completion time on a series-batching machine.
Inf. Process. Lett., 2009
Discret. Math., 2009
Comput. Oper. Res., 2009
2008
Theor. Comput. Sci., 2008
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan.
Theor. Comput. Sci., 2008
Single machine scheduling with release dates and job delivery to minimize the makespan.
Theor. Comput. Sci., 2008
Oper. Res. Lett., 2008
Oper. Res. Lett., 2008
Eur. J. Oper. Res., 2008
Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time.
Eur. J. Oper. Res., 2008
Eur. J. Oper. Res., 2008
Asia Pac. J. Oper. Res., 2008
Asia Pac. J. Oper. Res., 2008
2007
Theor. Comput. Sci., 2007
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan.
Theor. Comput. Sci., 2007
Online scheduling in a parallel batch processing system to minimize makespan using restarts.
Theor. Comput. Sci., 2007
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem.
J. Discrete Algorithms, 2007
A note on special optimal batching structures to minimize total weighted completion time.
J. Comb. Optim., 2007
Eur. J. Oper. Res., 2007
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption.
Eur. J. Oper. Res., 2007
Approximability of single machine scheduling with fixed jobs to minimize total completion time.
Eur. J. Oper. Res., 2007
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time.
Eur. J. Oper. Res., 2007
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard.
Eur. J. Oper. Res., 2007
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal.
Discret. Math., 2007
Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan.
Asia Pac. J. Oper. Res., 2007
2006
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs.
Theor. Comput. Sci., 2006
Single machine batch scheduling problem with family setup times and release dates to minimize makespan.
J. Sched., 2006
Approximation algorithms for shop scheduling problems with minsum objective: A correction.
J. Sched., 2006
J. Comb. Optim., 2006
Discret. Math., 2006
Proceedings of the Cryptology and Network Security, 5th International Conference, 2006
2005
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria.
Eur. J. Oper. Res., 2005
Eur. J. Oper. Res., 2005
Discret. Math., 2005
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times.
Comput. Oper. Res., 2005
Characterization of induced matching extendable graphs with 2n vertices and 3n-1 edges.
Australas. J Comb., 2005
2004
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan.
Theor. Comput. Sci., 2004
Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.
J. Interconnect. Networks, 2004
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times.
Eur. J. Oper. Res., 2004
2003
J. Sched., 2003
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs.
J. Sched., 2003
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard.
J. Sched., 2003
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., 2003
2002
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.
Oper. Res. Lett., 2002
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem.
Inf. Process. Lett., 2002
2001
2000
1998
Discret. Math., 1998
1996
Path-width and tree-width of the join of graphs.
Ars Comb., 1996
The automorphism groups of circulant digraphs of degree 3.
Ars Comb., 1996
1995