Jinjiang Yuan

According to our database1, Jinjiang Yuan authored at least 114 papers between 1995 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Complexities of four problems on two-agent scheduling.
Optimization Letters, 2018

Single-machine scheduling with operator non-availability to minimize total weighted completion time.
Inf. Sci., 2018

Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost.
Applied Mathematics and Computation, 2018

2017
Unary NP-hardness of minimizing the number of tardy jobs with deadlines.
J. Scheduling, 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 Generation Comp. Syst., 2017

Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints.
Discrete Optimization, 2017

A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost.
Computers & Industrial Engineering, 2017

Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs.
APJOR, 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

Unary NP-hardness of minimizing total weighted tardiness with generalized due dates.
Oper. Res. Lett., 2016

LPT online strategy for parallel-machine scheduling with kind release times.
Optimization Letters, 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.
Applied Mathematics and Computation, 2016

Online scheduling with linear deteriorating jobs to minimize the total weighted completion time.
Applied Mathematics and Computation, 2016

Rescheduling with new orders and general maximum allowable time disruptions.
4OR, 2016

2015
Single-machine batch scheduling with job processing time compatibility.
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

A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints.
J. Scheduling, 2015

A note on Pareto minimizing total completion time and maximum cost.
Oper. Res. Lett., 2015

A note on unbounded parallel-batch scheduling.
Inf. Process. Lett., 2015

On Graphs with a Unique Perfect Matching.
Graphs and Combinatorics, 2015

Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates.
Discrete Applied Mathematics, 2015

An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead.
APJOR, 2015

Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan.
APJOR, 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

Online scheduling of incompatible unit-length job families with lookahead.
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.
Optimization Letters, 2014

On matching cover of graphs.
Math. Program., 2014

Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan.
Inf. Process. Lett., 2014

On the vertex-arboricity of K5-minor-free graphs of diameter 2.
Discrete Mathematics, 2014

A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines.
APJOR, 2014

Batching Machine Scheduling with bicriteria: Maximum Cost and makespan.
APJOR, 2014

2013
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption.
J. Scheduling, 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

Unbounded parallel-batching scheduling with two competitive agents.
J. Scheduling, 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.
Discrete Applied Mathematics, 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. Scheduling, 2011

An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.
Inf. Process. Lett., 2011

Unbounded parallel-batch scheduling with family jobs and delivery coordination.
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. Systems Science, 2011

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.
European Journal of Operational Research, 2011

Best semi-online algorithms for unbounded parallel batch scheduling.
Discrete Applied Mathematics, 2011

2010
Single-machine scheduling under the job rejection constraint.
Theor. Comput. Sci., 2010

Preemptive scheduling with simple linear deterioration on a single machine.
Theor. Comput. Sci., 2010

Parallel-machine scheduling with deteriorating jobs and rejection.
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.
European Journal of Operational Research, 2010

Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion.
APJOR, 2010

2009
A best online algorithm for scheduling on two parallel batch machines.
Theor. Comput. Sci., 2009

Single machine parallel-batch scheduling with deteriorating jobs.
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

Scheduling with families of jobs and delivery coordination under job availability.
Theor. Comput. Sci., 2009

On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.
J. Scheduling, 2009

A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.
J. Comb. Optim., 2009

The weighted link ring loading problem.
J. Comb. Optim., 2009

Online scheduling on unbounded parallel-batch machines to minimize the makespan.
Inf. Process. Lett., 2009

A DP algorithm for minimizing makespan and total completion time on a series-batching machine.
Inf. Process. Lett., 2009

Single machine scheduling with release dates and rejection.
European Journal of Operational Research, 2009

Edge-deletable IM-extendable graphs with minimum number of edges.
Discrete Mathematics, 2009

Bounded single-machine parallel-batch scheduling with release dates and rejection.
Computers & OR, 2009

2008
A best on-line algorithm for single machine scheduling with small delivery times.
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

An inverse model for the most uniform problem.
Oper. Res. Lett., 2008

Unbounded parallel batch scheduling with job delivery to minimize makespan.
Oper. Res. Lett., 2008

On-line scheduling on a batch machine to minimize makespan with limited restarts.
Oper. Res. Lett., 2008

Single machine unbounded parallel-batch scheduling with forbidden intervals.
European Journal of Operational Research, 2008

Single Machine Scheduling with Forbidden Intervals and Job Delivery Times.
APJOR, 2008

Single Machine Scheduling with Job Delivery to minimize makespan.
APJOR, 2008

2007
On-line scheduling with delivery time on a single batch machine.
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

A note on the complexity of flow shop scheduling with transportation constraints.
European Journal of Operational Research, 2007

Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption.
European Journal of Operational Research, 2007

Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal.
Discrete Mathematics, 2007

On the vertex arboricity of planar graphs of diameter two.
Discrete Mathematics, 2007

Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan.
APJOR, 2007

2006
Approximation algorithms for shop scheduling problems with minsum objective: A correction.
J. Scheduling, 2006

Partition the vertices of a graph into one independent set and one acyclic set.
Discrete Mathematics, 2006

Upper minus domination in a claw-free cubic graph.
Discrete Mathematics, 2006

A Note of Perfect Nonlinear Functions.
Proceedings of the Cryptology and Network Security, 5th International Conference, 2006

2005
A note on the scheduling with two families of jobs.
J. Scheduling, 2005

Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria.
European Journal of Operational Research, 2005

A proof of an inequality concerning k-restricted edge connectivity.
Discrete Mathematics, 2005

4-regular claw-free IM-extendable graphs.
Discrete Mathematics, 2005

Characterization of induced matching extendable graphs with 2n vertices and 3n-1 edges.
Australasian J. Combinatorics, 2005

2004
Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.
Journal of Interconnection Networks, 2004

2003
On scheduling an unbounded batch machine.
Oper. Res. Lett., 2003

Partition the vertices of a graph into induced matchings.
Discrete Mathematics, 2003

2001
Maximal IM-unextendable graphs.
Discrete Mathematics, 2001

2000
Bondage number of planar graphs.
Discrete Mathematics, 2000

1998
Induced matching extendable graphs.
Journal of Graph Theory, 1998

Harper-type lower bounds and the bandwidths of the compositions of graphs.
Discrete Mathematics, 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
A local reductive elimination for the fill-in of graphs.
Discrete Mathematics, 1995


  Loading...