default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJinjiang Yuan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j182]Qixuan Yuan, Ruifang Liu, Jinjiang Yuan:
The spectral radius of H2k-free graphs. Appl. Math. Comput. 469: 128560 (2024)- [j181]Shanshan Guo, Fei Huang
, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs. Discret. Appl. Math. 345: 141-146 (2024) - [j180]Qiulan Zhao, Jinjiang Yuan:
Single-machine primary-secondary scheduling with total tardiness being the primary criterion. J. Sched. 27(3): 309-318 (2024) - 2023
- [j179]Qixuan Yuan, Ruifang Liu, Jinjiang Yuan:
The Aα-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree). Discret. Optim. 47: 100758 (2023) - [j178]Guoyan Ao, Ruifang Liu, Jinjiang Yuan:
Spectral radius and spanning trees of graphs. Discret. Math. 346(8): 113400 (2023) - [j177]Zhichao Geng, Jinjiang Yuan:
Single-machine scheduling of multiple projects with controllable processing times. Eur. J. Oper. Res. 308(3): 1074-1090 (2023) - [j176]Shanshan Guo, Fei Huang, Jinjiang Yuan:
Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete Graphs. Graphs Comb. 39(6): 124 (2023) - [j175]Rubing Chen, Yuan Gao, Zhichao Geng, Jinjiang Yuan:
Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. Int. J. Prod. Res. 61(22): 7630-7648 (2023) - 2022
- [j174]Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost. 4OR 20(2): 273-287 (2022) - [j173]Rubing Chen, Ruyan He, Jinjiang Yuan:
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs. Comput. Ind. Eng. 167: 107969 (2022) - [j172]Guoyan Ao, Ruifang Liu, Jinjiang Yuan, Rao Li:
Improved sufficient conditions for k-leaf-connected graphs. Discret. Appl. Math. 314: 17-30 (2022) - [j171]Yipei Zhang, Xiumei Wang, Jinjiang Yuan:
Bicritical graphs without removable edges. Discret. Appl. Math. 320: 1-10 (2022) - [j170]Luyi Li, Fei Huang, Jinjiang Yuan:
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three. Discret. Math. 345(6): 112838 (2022) - [j169]Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
On cycle-nice claw-free graphs. Discret. Math. 345(7): 112876 (2022) - [j168]Shanshan Guo, Fei Huang, Jinjiang Yuan:
Properly colored 2-factors of edge-colored complete bipartite graphs. Discret. Math. 345(12): 113094 (2022) - [j167]Rubing Chen, Zhichao Geng, Lingfa Lu, Jinjiang Yuan, Yuan Zhang:
Pareto-scheduling of two competing agents with their own equal processing times. Eur. J. Oper. Res. 301(2): 414-431 (2022) - [j166]Runjie Miao, Jinjiang Yuan:
A note on LP-based approximation algorithms for capacitated facility location problem. Theor. Comput. Sci. 932: 31-40 (2022) - 2021
- [j165]Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Bicriteria scheduling to minimize total late work and maximum tardiness with preemption. Comput. Ind. Eng. 159: 107525 (2021) - [j164]Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. Discret. Appl. Math. 304: 45-54 (2021) - [j163]Rubing Chen, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion. Eur. J. Oper. Res. 293(1): 79-92 (2021) - [j162]Ruyan He, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. J. Comb. Optim. 41(2): 504-525 (2021) - [j161]Wenjie Li, Jinjiang Yuan:
Single-machine online scheduling of jobs with non-delayed processing constraint. J. Comb. Optim. 41(4): 830-843 (2021) - [j160]Yuan Gao, Jinjiang Yuan, C. T. Ng, T. C. E. Cheng:
A note on competing-agent Pareto-scheduling. Optim. Lett. 15(1): 249-262 (2021) - [j159]Yuan Zhang, Jinjiang Yuan:
A note on the complexity of two supply chain scheduling problems. J. Sched. 24(4): 447-454 (2021) - [j158]Qiulan Zhao, Jinjiang Yuan:
Scheduling to tradeoff between the number and the length of accepted jobs. Theor. Comput. Sci. 891: 24-34 (2021) - 2020
- [j157]Rubing Chen, Jinjiang Yuan:
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR 18(2): 177-196 (2020) - [j156]Rubing Chen, Jinjiang Yuan, Zhichao Geng:
ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost. Appl. Math. Comput. 365 (2020) - [j155]Juan Zou, Jinjiang Yuan:
Single-machine scheduling with maintenance activities and rejection. Discret. Optim. 38: 100609 (2020) - [j154]Shanshan Zhang, Xiumei Wang, Jinjiang Yuan:
Even cycles and perfect matchings in claw-free plane graphs. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j153]Jinjiang Yuan, Chi To Ng, T. C. E. Cheng:
Scheduling with release dates and preemption to minimize multiple max-form objective functions. Eur. J. Oper. Res. 280(3): 860-875 (2020) - [j152]Qiulan Zhao, Jinjiang Yuan:
Bicriteria scheduling of equal length jobs on uniform parallel machines. J. Comb. Optim. 39(3): 637-661 (2020) - [j151]Shi-Sheng Li, Jinjiang Yuan:
Single-machine scheduling with multi-agents to minimize total weighted late work. J. Sched. 23(4): 497-512 (2020) - [j150]Fei Huang, Shanshan Guo, Jinjiang Yuan:
A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs. SIAM J. Discret. Math. 34(3): 2009-2015 (2020)
2010 – 2019
- 2019
- [j149]Xianglai Qi, Jinjiang Yuan:
Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing. Asia Pac. J. Oper. Res. 36(1): 1950002:1-1950002:16 (2019) - [j148]Chengwen Jiao, Jinjiang Yuan, Qi Feng:
Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead. Asia Pac. J. Oper. Res. 36(5): 1950024:1-1950024:8 (2019) - [j147]Fei Huang, Jinjiang Yuan:
On strong proper connection number of cubic graphs. Discret. Appl. Math. 265: 104-119 (2019) - [j146]Xiaozheng Chen, Fei Huang, Jinjiang Yuan:
Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles. Discret. Appl. Math. 265: 199-203 (2019) - [j145]Rubing Chen, Jinjiang Yuan, Lingfa Lu:
Single-machine scheduling with positional due indices and positional deadlines. Discret. Optim. 34 (2019) - [j144]Yuan Gao, Jinjiang Yuan, Chi To Ng, T. C. E. Cheng:
A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan. Eur. J. Oper. Res. 273(1): 74-81 (2019) - [j143]Yuan Zhang, Jinjiang Yuan:
A note on a two-agent scheduling problem related to the total weighted late work. J. Comb. Optim. 37(3): 989-999 (2019) - [j142]Yuan Gao, Jinjiang Yuan:
Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs. J. Comb. Optim. 38(3): 698-711 (2019) - [j141]Hongjun Wei, Jinjiang Yuan:
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time. Oper. Res. Lett. 47(1): 41-46 (2019) - [j140]Qiulan Zhao, Jinjiang Yuan:
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine. Oper. Res. Lett. 47(6): 607-610 (2019) - [j139]Yuan Gao, Jinjiang Yuan, Zhigang Wei:
Unbounded parallel-batch scheduling with drop-line tasks. J. Sched. 22(4): 449-463 (2019) - [j138]Rubing Chen, Jinjiang Yuan, Yuan Gao:
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. J. Sched. 22(5): 581-593 (2019) - [j137]Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. J. Sched. 22(5): 595-601 (2019) - [j136]Runjie Miao, Jinjiang Yuan, Fei Huang:
Paths and trails in edge-colored weighted graphs. Theor. Comput. Sci. 799: 104-114 (2019) - 2018
- [j135]Zhichao Geng, Jinjiang Yuan, Junling Yuan:
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost. Appl. Math. Comput. 332: 1-18 (2018) - [j134]Qijia Liu, Jinjiang Yuan:
Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery. Asia Pac. J. Oper. Res. 35(4): 1850026:1-1850026:12 (2018) - [j133]Long Wan, Jinjiang Yuan:
Single-machine scheduling with operator non-availability to minimize total weighted completion time. Inf. Sci. 445-446: 1-5 (2018) - [j132]Jinjiang Yuan:
Complexities of four problems on two-agent scheduling. Optim. Lett. 12(4): 763-780 (2018) - 2017
- [j131]Xianglai Qi, Jinjiang Yuan:
Semi-online hierarchical scheduling for $$l_p$$ l p -norm load balancing with buffer or rearrangements. 4OR 15(3): 265-276 (2017) - [j130]Qiulan Zhao, Jinjiang Yuan:
Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs. Asia Pac. J. Oper. Res. 34(5): 1750024:1-1750024:12 (2017) - [j129]Xianglai Qi, Jinjiang Yuan:
A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost. Comput. Ind. Eng. 111: 458-462 (2017) - [j128]Yuan Gao, Jinjiang Yuan:
Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints. Discret. Optim. 25: 105-119 (2017) - [j127]Long Wan, Lijun Wei, Naixue Xiong, Jinjiang Yuan, Jiacai Xiong:
Pareto optimization for the two-agent scheduling problems with linear non-increasing deterioration based on Internet of Things. Future Gener. Comput. Syst. 76: 293-300 (2017) - [j126]Jinjiang Yuan:
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. 34(2): 433-440 (2017) - [j125]Ran Ma, Jinjiang Yuan:
Online scheduling to minimize the total weighted completion time plus the rejection cost. J. Comb. Optim. 34(2): 483-503 (2017) - [j124]Ruyan Fu, Ji Tian, Shisheng Li, Jinjiang Yuan:
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities. J. Comb. Optim. 34(4): 1187-1197 (2017) - [j123]Jinjiang Yuan:
Unary NP-hardness of minimizing the number of tardy jobs with deadlines. J. Sched. 20(2): 211-218 (2017) - 2016
- [j122]Qiulan Zhao, Lingfa Lu, Jinjiang Yuan:
Rescheduling with new orders and general maximum allowable time disruptions. 4OR 14(3): 261-280 (2016) - [j121]Ran Ma, Jiping Tao, Jinjiang Yuan:
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Appl. Math. Comput. 273: 570-583 (2016) - [j120]Long Wan, Jinjiang Yuan, Lijun Wei:
Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost. Appl. Math. Comput. 273: 912-923 (2016) - [j119]Hailing Liu, Jinjiang Yuan, Wenjie Li:
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart. J. Comb. Optim. 31(4): 1609-1622 (2016) - [j118]Qijia Liu, Jinjiang Yuan:
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness. J. Comb. Optim. 32(2): 385-395 (2016) - [j117]Wenjie Li, Jinjiang Yuan:
LPT online strategy for parallel-machine scheduling with kind release times. Optim. Lett. 10(1): 159-168 (2016) - [j116]Yuan Gao, Jinjiang Yuan:
Unary NP-hardness of minimizing total weighted tardiness with generalized due dates. Oper. Res. Lett. 44(1): 92-95 (2016) - [j115]Liqi Zhang, Lingfa Lu, Jinjiang Yuan:
Two-machine open-shop scheduling with rejection to minimize the makespan. OR Spectr. 38(2): 519-529 (2016) - [j114]Ji Tian, Qian Wang, Ruyan Fu, Jinjiang Yuan:
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time. Theor. Comput. Sci. 617: 65-68 (2016) - [j113]Youjun Chen, Lingfa Lu, Jinjiang Yuan:
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time. Theor. Comput. Sci. 622: 45-65 (2016) - 2015
- [j112]Wenhua Li, Jie Gao, Jinjiang Yuan:
Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan. Asia Pac. J. Oper. Res. 32(4): 1550028:1-1550028:15 (2015) - [j111]Wenjie Li, Jinjiang Yuan:
An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead. Asia Pac. J. Oper. Res. 32(6): 1550047:1-1550047:9 (2015) - [j110]Yuan Gao, Jinjiang Yuan:
Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates. Discret. Appl. Math. 189: 49-52 (2015) - [j109]Xiumei Wang, Weiping Shang, Jinjiang Yuan:
On Graphs with a Unique Perfect Matching. Graphs Comb. 31(5): 1765-1777 (2015) - [j108]Zhichao Geng, Jinjiang Yuan:
A note on unbounded parallel-batch scheduling. Inf. Process. Lett. 115(12): 969-974 (2015) - [j107]Yuan Gao, Jinjiang Yuan:
A note on Pareto minimizing total completion time and maximum cost. Oper. Res. Lett. 43(1): 80-82 (2015) - [j106]Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng:
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness. J. Sched. 18(2): 147-153 (2015) - [j105]Long Wan, Jinjiang Yuan, Zhichao Geng:
A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints. J. Sched. 18(3): 315-323 (2015) - [j104]Zhichao Geng, Jinjiang Yuan:
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness. Theor. Comput. Sci. 570: 22-29 (2015) - [j103]Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Single-machine batch scheduling with job processing time compatibility. Theor. Comput. Sci. 583: 57-66 (2015) - [j102]Youjun Chen, Lingfa Lu, Jinjiang Yuan:
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time. Theor. Comput. Sci. 583: 67-77 (2015) - 2014
- [j101]Cheng He, Hao Lin, Jinjiang Yuan, Yundong Mu:
Batching Machine Scheduling with bicriteria: Maximum Cost and makespan. Asia Pac. J. Oper. Res. 31(4) (2014) - [j100]Chengwen Jiao, Wenhua Li, Jinjiang Yuan:
A Best Possible Online Algorithm for Scheduling to minimize Maximum Flow-Time on Bounded batch Machines. Asia Pac. J. Oper. Res. 31(4) (2014) - [j99]Fei Huang, Xiumei Wang, Jinjiang Yuan:
On the vertex-arboricity of K5-minor-free graphs of diameter 2. Discret. Math. 322: 1-4 (2014) - [j98]Ruyan Fu, Ji Tian, Jinjiang Yuan, Ya Li:
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan. Inf. Process. Lett. 114(4): 179-184 (2014) - [j97]Xiumei Wang, Xiaoxin Song, Jinjiang Yuan:
On matching cover of graphs. Math. Program. 147(1-2): 499-518 (2014) - [j96]Wenjie Li, Jinjiang Yuan:
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs. Optim. Lett. 8(5): 1691-1706 (2014) - [j95]Long Wan, Ran Ma, Jinjiang Yuan:
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. 518: 117-123 (2014) - [j94]Hailing Liu, Jinjiang Yuan:
Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart. Theor. Comput. Sci. 543: 24-36 (2014) - [j93]Wenhua Li, Jinjiang Yuan, Sufang Yang:
Online scheduling of incompatible unit-length job families with lookahead. Theor. Comput. Sci. 543: 120-125 (2014) - 2013
- [j92]Ruifang Liu, Huicai Jia, Jinjiang Yuan:
Tree with minimal Laplacian spectral radius and diameter n-4. Ars Comb. 109: 345-352 (2013) - [j91]Ran Ma, Jinjiang Yuan:
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. 113(17): 593-598 (2013) - [j90]Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan:
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Oper. Res. Lett. 41(3): 216-219 (2013) - [j89]Long Wan, Jinjiang Yuan:
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. Oper. Res. Lett. 41(4): 363-365 (2013) - [j88]Qiulan Zhao, Jinjiang Yuan:
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption. J. Sched. 16(3): 253-260 (2013) - [j87]S. S. Li, Peter Brucker, Chi To Ng, T. C. Edwin Cheng, Natalia V. Shakhlevich, Jinjiang Yuan:
A note on reverse scheduling with maximum lateness objective. J. Sched. 16(4): 417-422 (2013) - 2012
- [j86]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. Discret. Appl. Math. 160(7-8): 1191-1210 (2012) - [j85]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. 112(12): 503-508 (2012) - [j84]Shisheng Li, Jinjiang Yuan:
Unbounded parallel-batching scheduling with two competitive agents. J. Sched. 15(5): 629-640 (2012) - [j83]Junling Yuan, Wenhua Li, Jinjiang Yuan:
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints. Theor. Comput. Sci. 457: 174-180 (2012) - 2011
- [j82]Jinjiang Yuan, C. T. Ng, T. C. Edwin Cheng:
Best semi-online algorithms for unbounded parallel batch scheduling. Discret. Appl. Math. 159(8): 838-847 (2011) - [j81]Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur. J. Oper. Res. 210(3): 482-488 (2011) - [j80]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. Syst. Sci. 42(1): 51-55 (2011) - [j79]Shisheng Li, Jinjiang Yuan, Baoqiang Fan:
Unbounded parallel-batch scheduling with family jobs and delivery coordination. Inf. Process. Lett. 111(12): 575-582 (2011) - [j78]Wenhua Li, Jinjiang Yuan:
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time. Inf. Process. Lett. 111(18): 907-911 (2011) - [j77]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. 111(21-22): 1048-1053 (2011) - [j76]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. Sched. 14(4): 361-369 (2011) - [j75]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. 412(22): 2380-2386 (2011) - 2010
- [j74]Cheng He, Yixun Lin, Jinjiang Yuan:
Some Improved Algorithms on the Single Machine Hierarchical Scheduling with Total tardiness as the Primary Criterion. Asia Pac. J. Oper. Res. 27(5): 577-585 (2010) - [j73]Cheng He, Yixun Lin, Jinjiang Yuan:
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines. Eur. J. Oper. Res. 201(3): 966-970 (2010) - [j72]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. 110(11): 444-450 (2010) - [j71]Shisheng Li, Jinjiang Yuan:
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan. J. Comb. Optim. 19(1): 84-93 (2010) - [j70]Liqi Zhang, Lingfa Lu, Jinjiang Yuan:
Single-machine scheduling under the job rejection constraint. Theor. Comput. Sci. 411(16-18): 1877-1882 (2010) - [j69]C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan:
Preemptive scheduling with simple linear deterioration on a single machine. Theor. Comput. Sci. 411(40-42): 3578-3586 (2010) - [j68]Shisheng Li, Jinjiang Yuan:
Parallel-machine scheduling with deteriorating jobs and rejection. Theor. Comput. Sci. 411(40-42): 3642-3650 (2010)
2000 – 2009
- 2009
- [j67]Lingfa Lu, T. C. Edwin Cheng, Jinjiang Yuan, Liqi Zhang:
Bounded single-machine parallel-batch scheduling with release dates and rejection. Comput. Oper. Res. 36(10): 2748-2751 (2009) - [j66]Xiumei Wang, Jinjiang Yuan, Sujing Zhou:
Edge-deletable IM-extendable graphs with minimum number of edges. Discret. Math. 309(16): 5242-5247 (2009) - [j65]Liqi Zhang, Lingfa Lu, Jinjiang Yuan:
Single machine scheduling with release dates and rejection. Eur. J. Oper. Res. 198(3): 975-978 (2009) - [j64]Cheng He, Yixun Lin, Jinjiang Yuan:
A DP algorithm for minimizing makespan and total completion time on a series-batching machine. Inf. Process. Lett. 109(12): 603-607 (2009) - [j63]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. 109(21-22): 1211-1215 (2009) - [j62]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. 17(2): 206-213 (2009) - [j61]Qingqin Nong, Jinjiang Yuan, Yixun Lin:
The weighted link ring loading problem. J. Comb. Optim. 18(1): 38-50 (2009) - [j60]Ruyan Fu, Ji Tian, Jinjiang Yuan:
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. J. Sched. 12(1): 91-97 (2009) - [j59]Xianglai Qi, Shiguo Zhou, Jinjiang Yuan:
Single machine parallel-batch scheduling with deteriorating jobs. Theor. Comput. Sci. 410(8-10): 830-836 (2009) - [j58]Ji Tian, Ruyan Fu, Jinjiang Yuan:
A best online algorithm for scheduling on two parallel batch machines. Theor. Comput. Sci. 410(21-23): 2291-2294 (2009) - [j57]Shisheng Li, Jinjiang Yuan:
Scheduling with families of jobs and delivery coordination under job availability. Theor. Comput. Sci. 410(47-49): 4856-4863 (2009) - [j56]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. 410(47-49): 5182-5187 (2009) - 2008
- [j55]Lingfa Lu, Jinjiang Yuan:
Single Machine Scheduling with Job Delivery to minimize makespan. Asia Pac. J. Oper. Res. 25(1): 1-10 (2008) - [j54]Jinjiang Yuan, Lei Shi, Jinwen Ou:
Single Machine Scheduling with Forbidden Intervals and Job Delivery Times. Asia Pac. J. Oper. Res. 25(3): 317-325 (2008) - [j53]Jinjiang Yuan, Xianglai Qi, Lingfa Lu, Wenhua Li:
Single machine unbounded parallel-batch scheduling with forbidden intervals. Eur. J. Oper. Res. 186(3): 1212-1217 (2008) - [j52]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Multi-agent scheduling on a single machine with max-form criteria. Eur. J. Oper. Res. 188(2): 603-609 (2008) - [j51]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time. Eur. J. Oper. Res. 191(2): 320-331 (2008) - [j50]Qin Wang, Jinjiang Yuan, Jianzhong Zhang:
An inverse model for the most uniform problem. Oper. Res. Lett. 36(1): 26-30 (2008) - [j49]Ruyan Fu, Ji Tian, Jinjiang Yuan, Cheng He:
On-line scheduling on a batch machine to minimize makespan with limited restarts. Oper. Res. Lett. 36(2): 255-258 (2008) - [j48]Lingfa Lu, Jinjiang Yuan:
Unbounded parallel batch scheduling with job delivery to minimize makespan. Oper. Res. Lett. 36(4): 477-480 (2008) - [j47]Lingfa Lu, Jinjiang Yuan, Liqi Zhang:
Single machine scheduling with release dates and job delivery to minimize the makespan. Theor. Comput. Sci. 393(1-3): 102-108 (2008) - [j46]Ji Tian, Ruyan Fu, Jinjiang Yuan:
A best on-line algorithm for single machine scheduling with small delivery times. Theor. Comput. Sci. 393(1-3): 287-293 (2008) - [j45]Lingfa Lu, Liqi Zhang, Jinjiang Yuan:
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theor. Comput. Sci. 396(1-3): 283-289 (2008) - 2007
- [j44]Jinjiang Yuan, Yundong Mu, Lingfa Lu, Wenhua Li:
Rescheduling with Release dates to minimize Total Sequence Disruption under a Limit on the makespan. Asia Pac. J. Oper. Res. 24(6): 789-796 (2007) - [j43]Zhao Zhang, Jinjiang Yuan:
Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. Discret. Math. 307(2): 293-298 (2007) - [j42]Aifeng Yang, Jinjiang Yuan:
On the vertex arboricity of planar graphs of diameter two. Discret. Math. 307(19-20): 2438-2447 (2007) - [j41]Lingfa Lu, Jinjiang Yuan:
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard. Eur. J. Oper. Res. 177(2): 1302-1309 (2007) - [j40]Jinjiang Yuan, Y. X. Lin, C. T. Ng, T. C. Edwin Cheng:
Approximability of single machine scheduling with fixed jobs to minimize total completion time. Eur. J. Oper. Res. 178(1): 46-56 (2007) - [j39]Jinjiang Yuan, T. C. Edwin Cheng, C. T. Ng:
NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time. Eur. J. Oper. Res. 178(2): 631-633 (2007) - [j38]Jinjiang Yuan, Ameur Soukhal, Youjun Chen, Lingfa Lu:
A note on the complexity of flow shop scheduling with transportation constraints. Eur. J. Oper. Res. 178(3): 918-925 (2007) - [j37]Jinjiang Yuan, Yundong Mu:
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. Eur. J. Oper. Res. 182(2): 936-944 (2007) - [j36]Wenhua Li, Jinjiang Yuan, Yixun Lin:
A note on special optimal batching structures to minimize total weighted completion time. J. Comb. Optim. 14(4): 475-480 (2007) - [j35]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 5(3): 609-621 (2007) - [j34]Ji Tian, Ruyan Fu, Jinjiang Yuan:
On-line scheduling with delivery time on a single batch machine. Theor. Comput. Sci. 374(1-3): 49-57 (2007) - [j33]Ruyan Fu, Ji Tian, Jinjiang Yuan, Yixun Lin:
Online scheduling in a parallel batch processing system to minimize makespan using restarts. Theor. Comput. Sci. 374(1-3): 196-202 (2007) - [j32]Cheng He, Yixun Lin, Jinjiang Yuan:
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. Theor. Comput. Sci. 381(1-3): 234-240 (2007) - 2006
- [j31]Aifeng Yang, Jinjiang Yuan:
Partition the vertices of a graph into one independent set and one acyclic set. Discret. Math. 306(12): 1207-1216 (2006) - [j30]Weiping Shang, Jinjiang Yuan:
Upper minus domination in a claw-free cubic graph. Discret. Math. 306(22): 2983-2988 (2006) - [j29]C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
A note on the complexity of the problem of two-agent scheduling on a single machine. J. Comb. Optim. 12(4): 387-394 (2006) - [j28]Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng:
Single machine batch scheduling problem with family setup times and release dates to minimize makespan. J. Sched. 9(6): 499-513 (2006) - [j27]Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan:
Approximation algorithms for shop scheduling problems with minsum objective: A correction. J. Sched. 9(6): 569-570 (2006) - [j26]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor. Comput. Sci. 362(1-3): 273-281 (2006) - [c1]Xiyong Zhang, Hua Guo, Jinjiang Yuan:
A Note of Perfect Nonlinear Functions. CANS 2006: 259-269 - 2005
- [j25]Ju Zhou, Jinjiang Yuan:
Characterization of induced matching extendable graphs with 2n vertices and 3n-1 edges. Australas. J Comb. 33: 255-264 (2005) - [j24]T. C. Edwin Cheng, Jinjiang Yuan, A. F. Yang:
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times. Comput. Oper. Res. 32: 849-859 (2005) - [j23]Qin Wang, Jinjiang Yuan:
4-regular claw-free IM-extendable graphs. Discret. Math. 294(3): 303-309 (2005) - [j22]Zhao Zhang, Jinjiang Yuan:
A proof of an inequality concerning k-restricted edge connectivity. Discret. Math. 304(1-3): 128-134 (2005) - [j21]Jinjiang Yuan, Yixun Lin:
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria. Eur. J. Oper. Res. 164(3): 851-855 (2005) - [j20]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan, Zhaohui Liu:
Single machine scheduling to minimize total weighted tardiness. Eur. J. Oper. Res. 165(2): 423-443 (2005) - [j19]Jinjiang Yuan, Weiping Shang, Qi Feng:
A note on the scheduling with two families of jobs. J. Sched. 8(6): 537-542 (2005) - 2004
- [j18]Jinjiang Yuan, A. F. Yang, T. C. Edwin Cheng:
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. Eur. J. Oper. Res. 158(2): 525-528 (2004) - [j17]Jinjiang Yuan, Sanming Zhou:
Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem With Integer Splitting. J. Interconnect. Networks 5(2): 193-200 (2004) - [j16]Jinjiang Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng:
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan. Theor. Comput. Sci. 320(2-3): 199-212 (2004) - 2003
- [j15]Jinjiang Yuan, Qin Wang:
Partition the vertices of a graph into induced matchings. Discret. Math. 263(1-3): 323-329 (2003) - [j14]Zhaohui Liu, Jinjiang Yuan, T. C. Edwin Cheng:
On scheduling an unbounded batch machine. Oper. Res. Lett. 31(1): 42-48 (2003) - [j13]C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan, Zhaohui Liu:
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. 31(3): 323-326 (2003) - [j12]C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs. J. Sched. 6(4): 405-412 (2003) - [j11]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard. J. Sched. 6(5): 483-490 (2003) - [j10]T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs. J. Sched. 6(6): 551-555 (2003) - 2002
- [j9]C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem. Inf. Process. Lett. 82(4): 187-191 (2002) - [j8]C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints. Oper. Res. Lett. 30(1): 66-68 (2002) - 2001
- [j7]Qin Wang, Jinjiang Yuan:
Maximal IM-unextendable graphs. Discret. Math. 240(1-3): 295-298 (2001) - 2000
- [j6]Liying Kang, Jinjiang Yuan:
Bondage number of planar graphs. Discret. Math. 222(1-3): 191-198 (2000)
1990 – 1999
- 1998
- [j5]Sanming Zhou, Jinjiang Yuan:
Harper-type lower bounds and the bandwidths of the compositions of graphs. Discret. Math. 181(1-3): 255-266 (1998) - [j4]Jinjiang Yuan:
Induced matching extendable graphs. J. Graph Theory 28(4): 203-213 (1998) - 1996
- [j3]Jinjiang Yuan:
Path-width and tree-width of the join of graphs. Ars Comb. 43 (1996) - [j2]Qiongxiang Huang, Jinjiang Yuan:
The automorphism groups of circulant digraphs of degree 3. Ars Comb. 44 (1996) - 1995
- [j1]Jinjiang Yuan:
A local reductive elimination for the fill-in of graphs. Discret. Math. 147(1-3): 321-327 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
