Yuan Jinjiang

Jinjiang Yuan

Information about the author Jinjiang Yuan will soon be added to the site.
Found 27 papers in total
Semi-online hierarchical scheduling for lp-norm load balancing with buffer or rearrangements
Semi-online hierarchical scheduling for lp-norm load balancing with buffer or rearrangements
2017
In this paper, we consider the semi‐online hierarchical scheduling for load...
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
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
2017
We study the multi‐agent scheduling on a single machine with a fixed number of...
Online scheduling to minimize the total weighted completion time plus the rejection cost
Online scheduling to minimize the total weighted completion time plus the rejection cost
2017
We consider the online scheduling on a single machine, in which jobs are released over...
Unary NP-hardness of minimizing the number of tardy jobs with deadlines
Unary NP-hardness of minimizing the number of tardy jobs with deadlines
2017
For single machine scheduling to minimize the number of tardy jobs with deadlines,...
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
2016
In this paper, we study the online scheduling of linear deteriorating jobs on a single...
Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
2016
This paper investigates the Pareto optimization scheduling problem on a single machine...
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
2014
We consider the online scheduling of equal‐length jobs with incompatible...
Unbounded parallel‐batch scheduling with family jobs and delivery coordination
Unbounded parallel‐batch scheduling with family jobs and delivery coordination
2011
We study a scheduling problem that integrates parallel-batch production with family...
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
2013
We consider the rescheduling on a single machine with release dates to minimize the...
Unbounded parallel‐batching scheduling with two competitive agents
Unbounded parallel‐batching scheduling with two competitive agents
2012
We consider the scheduling problems arising when two agents, each with a family of...
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
2011
This paper considers the problem of scheduling deteriorating jobs and due date...
Group scheduling and due date assignment on a single machine
Group scheduling and due date assignment on a single machine
2011
We consider a single‐machine scheduling problem involving both the due date...
A best online algorithm for unbounded parallel‐batch scheduling with restarts to minimize makespan
A best online algorithm for unbounded parallel‐batch scheduling with restarts to minimize makespan
2011
We consider online scheduling with restarts in an unbounded parallel‐batch...
Unbounded parallel batch scheduling with job delivery to minimize makespan
Unbounded parallel batch scheduling with job delivery to minimize makespan
2008
We consider unbounded parallel batch scheduling with job delivery to minimize...
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
2010
We consider the scheduling of n family jobs with release dates on m identical parallel...
Single machine scheduling with job delivery to minimize makespan
Single machine scheduling with job delivery to minimize makespan
2008
In the single machine scheduling problem with job delivery to minimize makespan, jobs...
Single machine scheduling with forbidden intervals and job delivery times
Single machine scheduling with forbidden intervals and job delivery times
2008
We consider a non-preemptive single machine scheduling problem with forbidden...
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
2009
We consider a single batch machine on-line scheduling problem with delivery times. In...
An inverse model for the most uniform problem
An inverse model for the most uniform problem
2008
In this paper, we consider a kind of inverse model for the most uniform problem. This...
On-line scheduling on a batch machine to minimize makespan with limited restarts
On-line scheduling on a batch machine to minimize makespan with limited restarts
2008
We study the on-line scheduling on an unbounded batch machine to minimize makespan. In...
A note on the complexity of flow shop scheduling with transportation constraints
A note on the complexity of flow shop scheduling with transportation constraints
2007
This note investigates two-machine flow shop scheduling with transportation...
The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan
The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan
2008
In this paper we consider the single-machine parallel-batching scheduling problem with...
Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan
Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan
2007
In this paper, we consider the rescheduling problem for jobs on a single machine with...
A note on special optimal batching structures to minimize total weighted completion time
A note on special optimal batching structures to minimize total weighted completion time
2007
A batch is a subset of jobs which must be processed jointly in either serial or...
Papers per page: