| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Wenjie Li, Zhenkun Zhang, Hailing Liu, Jinjiang Yuan |
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 |
DBLP DOI BibTeX RDF |
|
| 1 | Ji Tian, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan |
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ji Tian, Ruyan Fu, Jinjiang Yuan |
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times.  |
Inf. Process. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenhua Li, Jinjiang Yuan |
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time.  |
Inf. Process. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shisheng Li, Jinjiang Yuan, Baoqiang Fan |
Unbounded parallel-batch scheduling with family jobs and delivery coordination.  |
Inf. Process. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan |
Online scheduling on unbounded parallel-batch machines with incompatible job families.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan |
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan.  |
European Journal of Operational Research  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Ruyan Fu, C. T. Ng, T. C. Edwin Cheng |
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan.  |
J. Scheduling  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng |
Best semi-online algorithms for unbounded parallel batch scheduling.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianfa Cao, Jinjiang Yuan, Wenjie Li, Hailin Bu |
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 |
DBLP DOI BibTeX RDF |
|
| 1 | Shisheng Li, Jinjiang Yuan |
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan.  |
J. Comb. Optim.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruyan Fu, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan |
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan.  |
Inf. Process. Lett.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan |
Preemptive scheduling with simple linear deterioration on a single machine.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shisheng Li, Jinjiang Yuan |
Parallel-machine scheduling with deteriorating jobs and rejection.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Liqi Zhang, Lingfa Lu, Jinjiang Yuan |
Single-machine scheduling under the job rejection constraint.  |
Theor. Comput. Sci.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng He, Yixun Lin, Jinjiang Yuan |
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines.  |
European Journal of Operational Research  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng He, Yixun Lin, Jinjiang Yuan |
Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion.  |
APJOR  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qingqin Nong, Jinjiang Yuan, Yixun Lin |
The weighted link ring loading problem.  |
J. Comb. Optim.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu |
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times.  |
J. Comb. Optim.  |
2009 |
DBLP DOI BibTeX RDF |
Parallel-batching, Delivery time, Scheduling, On-line algorithm |
| 1 | Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan |
Online scheduling on unbounded parallel-batch machines to minimize the makespan.  |
Inf. Process. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng He, Yixun Lin, Jinjiang Yuan |
A DP algorithm for minimizing makespan and total completion time on a series-batching machine.  |
Inf. Process. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenjie Li, Jinjiang Yuan, Jianfa Cao, Hailin Bu |
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shisheng Li, Jinjiang Yuan |
Scheduling with families of jobs and delivery coordination under job availability.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ji Tian, Ruyan Fu, Jinjiang Yuan |
A best online algorithm for scheduling on two parallel batch machines.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xianglai Qi, Shiguo Zhou, Jinjiang Yuan |
Single machine parallel-batch scheduling with deteriorating jobs.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiumei Wang, Jinjiang Yuan, Sujing Zhou |
Edge-deletable IM-extendable graphs with minimum number of edges.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Liqi Zhang, Lingfa Lu, Jinjiang Yuan |
Single machine scheduling with release dates and rejection.  |
European Journal of Operational Research  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruyan Fu, Ji Tian, Jinjiang Yuan |
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs.  |
J. Scheduling  |
2009 |
DBLP DOI BibTeX RDF |
Job families, Competitive ratio, On-line scheduling, Batch machine |
| 1 | Lingfa Lu, T. C. Edwin Cheng, Jinjiang Yuan, Liqi Zhang |
Bounded single-machine parallel-batch scheduling with release dates and rejection.  |
Computers & OR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Qin Wang, Jinjiang Yuan, Jianzhong Zhang 0001 |
An inverse model for the most uniform problem.  |
Oper. Res. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He |
On-line scheduling on a batch machine to minimize makespan with limited restarts.  |
Oper. Res. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lingfa Lu, Jinjiang Yuan |
Unbounded parallel batch scheduling with job delivery to minimize makespan.  |
Oper. Res. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ji Tian, Ruyan Fu, Jinjiang Yuan |
A best on-line algorithm for single machine scheduling with small delivery times.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lingfa Lu, Liqi Zhang, Jinjiang Yuan |
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lingfa Lu, Jinjiang Yuan, Liqi Zhang |
Single machine scheduling with release dates and job delivery to minimize the makespan.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Xianglai Qi, Lingfa Lu, Wenhua Li |
Single machine unbounded parallel-batch scheduling with forbidden intervals.  |
European Journal of Operational Research  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Lei Shi, Jinwen Ou |
Single Machine Scheduling with Forbidden Intervals and Job Delivery Times.  |
APJOR  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lingfa Lu, Jinjiang Yuan |
Single Machine Scheduling with Job Delivery to minimize makespan.  |
APJOR  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenhua Li, Jinjiang Yuan, Yixun Lin |
A note on special optimal batching structures to minimize total weighted completion time.  |
J. Comb. Optim.  |
2007 |
DBLP DOI BibTeX RDF |
Total weighted complete time, Scheduling, Batching |
| 1 | Cheng He, Yixun Lin, Jinjiang Yuan |
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruyan Fu, Ji Tian, Jinjiang Yuan, Yixun Lin |
Online scheduling in a parallel batch processing system to minimize makespan using restarts.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ji Tian, Ruyan Fu, Jinjiang Yuan |
On-line scheduling with delivery time on a single batch machine.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhao Zhang, Jinjiang Yuan |
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Ameur Soukhal, Youjun Chen, Lingfa Lu |
A note on the complexity of flow shop scheduling with transportation constraints.  |
European Journal of Operational Research  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Yundong Mu |
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption.  |
European Journal of Operational Research  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Yundong Mu, Lingfa Lu, Wenhua Li |
Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan.  |
APJOR  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Jian Ying Zhang, Sanming Zhou |
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem.  |
J. Discrete Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Weiping Shang, Jinjiang Yuan |
Upper minus domination in a claw-free cubic graph.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Aifeng Yang, Jinjiang Yuan |
Partition the vertices of a graph into one independent set and one acyclic set.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan |
Approximation algorithms for shop scheduling problems with minsum objective: A correction.  |
J. Scheduling  |
2006 |
DBLP DOI BibTeX RDF |
Shop scheduling, Approximation algorithms |
| 1 | Xiyong Zhang, Hua Guo, Jinjiang Yuan |
A Note of Perfect Nonlinear Functions.  |
CANS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhao Zhang, Jinjiang Yuan |
A proof of an inequality concerning k-restricted edge connectivity.  |
Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Yixun Lin |
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria.  |
European Journal of Operational Research  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Sanming Zhou |
Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting.  |
Journal of Interconnection Networks  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng |
On scheduling an unbounded batch machine.  |
Oper. Res. Lett.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinjiang Yuan, Qin Wang |
Partition the vertices of a graph into induced matchings.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Qin Wang, Jinjiang Yuan |
Maximal IM-unextendable graphs.  |
Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Liying Kang, Jinjiang Yuan |
Bondage number of planar graphs.  |
Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanming Zhou, Jinjiang Yuan |
Harper-type lower bounds and the bandwidths of the compositions of graphs.  |
Discrete Mathematics  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiongxiang Huang, Jinjiang Yuan |
The automorphism groups of circulant digraphs of degree 3.  |
Ars Comb.  |
1996 |
DBLP BibTeX RDF |
|
| 1 | Jinjiang Yuan |
Path-width and tree-width of the join of graphs.  |
Ars Comb.  |
1996 |
DBLP BibTeX RDF |
|
| 1 | Jinjiang Yuan |
A local reductive elimination for the fill-in of graphs.  |
Discrete Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|