default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jinjiang Yuan
@article{DBLP:journals/amc/YuanLY24,
author = {Qixuan Yuan and
Ruifang Liu and
Jinjiang Yuan},
title = {The spectral radius of \emph{H}\({}_{\mbox{2\emph{k}}}\)-free graphs},
journal = {Appl. Math. Comput.},
volume = {469},
pages = {128560},
year = {2024},
url = {https://doi.org/10.1016/j.amc.2024.128560},
doi = {10.1016/J.AMC.2024.128560},
timestamp = {Sun, 25 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/YuanLY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GuoHYNC24,
author = {Shanshan Guo and
Fei Huang and
Jinjiang Yuan and
C. T. Ng and
T. C. E. Cheng},
title = {Properly colored cycles in edge-colored 2-colored-triangle-free complete
graphs},
journal = {Discret. Appl. Math.},
volume = {345},
pages = {141--146},
year = {2024},
url = {https://doi.org/10.1016/j.dam.2023.11.045},
doi = {10.1016/J.DAM.2023.11.045},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GuoHYNC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ZhaoY24,
author = {Qiulan Zhao and
Jinjiang Yuan},
title = {Single-machine primary-secondary scheduling with total tardiness being
the primary criterion},
journal = {J. Sched.},
volume = {27},
number = {3},
pages = {309--318},
year = {2024},
url = {https://doi.org/10.1007/s10951-023-00793-7},
doi = {10.1007/S10951-023-00793-7},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ZhaoY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/YuanLY23,
author = {Qixuan Yuan and
Ruifang Liu and
Jinjiang Yuan},
title = {The A{\(\alpha\)}-spectral radius of nonregular graphs (digraphs)
and maximum degree (outdegree)},
journal = {Discret. Optim.},
volume = {47},
pages = {100758},
year = {2023},
url = {https://doi.org/10.1016/j.disopt.2022.100758},
doi = {10.1016/J.DISOPT.2022.100758},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/YuanLY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AoLY23,
author = {Guoyan Ao and
Ruifang Liu and
Jinjiang Yuan},
title = {Spectral radius and spanning trees of graphs},
journal = {Discret. Math.},
volume = {346},
number = {8},
pages = {113400},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2023.113400},
doi = {10.1016/J.DISC.2023.113400},
timestamp = {Mon, 05 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/AoLY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GengY23,
author = {Zhichao Geng and
Jinjiang Yuan},
title = {Single-machine scheduling of multiple projects with controllable processing
times},
journal = {Eur. J. Oper. Res.},
volume = {308},
number = {3},
pages = {1074--1090},
year = {2023},
url = {https://doi.org/10.1016/j.ejor.2023.01.026},
doi = {10.1016/J.EJOR.2023.01.026},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/GengY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GuoHY23,
author = {Shanshan Guo and
Fei Huang and
Jinjiang Yuan},
title = {Proper Cycles and Rainbow Cycles in 2-triangle-free edge-colored Complete
Graphs},
journal = {Graphs Comb.},
volume = {39},
number = {6},
pages = {124},
year = {2023},
url = {https://doi.org/10.1007/s00373-023-02722-z},
doi = {10.1007/S00373-023-02722-Z},
timestamp = {Sun, 31 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/GuoHY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijpr/ChenGGY23,
author = {Rubing Chen and
Yuan Gao and
Zhichao Geng and
Jinjiang Yuan},
title = {Revisit the scheduling problem with assignable or generalized due
dates to minimize total weighted late work},
journal = {Int. J. Prod. Res.},
volume = {61},
number = {22},
pages = {7630--7648},
year = {2023},
url = {https://doi.org/10.1080/00207543.2022.2160502},
doi = {10.1080/00207543.2022.2160502},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijpr/ChenGGY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/GaoYNC22,
author = {Yuan Gao and
Jinjiang Yuan and
C. T. Ng and
T. C. E. Cheng},
title = {Pareto-scheduling with family jobs or ND-agent on a parallel-batch
machine to minimize the makespan and maximum cost},
journal = {4OR},
volume = {20},
number = {2},
pages = {273--287},
year = {2022},
url = {https://doi.org/10.1007/s10288-021-00480-3},
doi = {10.1007/S10288-021-00480-3},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/GaoYNC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/ChenHY22,
author = {Rubing Chen and
Ruyan He and
Jinjiang Yuan},
title = {Preemptive scheduling to minimize total weighted late work and weighted
number of tardy jobs},
journal = {Comput. Ind. Eng.},
volume = {167},
pages = {107969},
year = {2022},
url = {https://doi.org/10.1016/j.cie.2022.107969},
doi = {10.1016/J.CIE.2022.107969},
timestamp = {Wed, 30 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/candie/ChenHY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AoLYL22,
author = {Guoyan Ao and
Ruifang Liu and
Jinjiang Yuan and
Rao Li},
title = {Improved sufficient conditions for k-leaf-connected graphs},
journal = {Discret. Appl. Math.},
volume = {314},
pages = {17--30},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.02.020},
doi = {10.1016/J.DAM.2022.02.020},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AoLYL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ZhangWY22,
author = {Yipei Zhang and
Xiumei Wang and
Jinjiang Yuan},
title = {Bicritical graphs without removable edges},
journal = {Discret. Appl. Math.},
volume = {320},
pages = {1--10},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.04.026},
doi = {10.1016/J.DAM.2022.04.026},
timestamp = {Thu, 22 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ZhangWY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiHY22,
author = {Luyi Li and
Fei Huang and
Jinjiang Yuan},
title = {Proper vertex-pancyclicity of edge-colored complete graphs without
monochromatic paths of length three},
journal = {Discret. Math.},
volume = {345},
number = {6},
pages = {112838},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.112838},
doi = {10.1016/J.DISC.2022.112838},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/LiHY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhangWYNC22,
author = {Shanshan Zhang and
Xiumei Wang and
Jinjiang Yuan and
C. T. Ng and
T. C. E. Cheng},
title = {On cycle-nice claw-free graphs},
journal = {Discret. Math.},
volume = {345},
number = {7},
pages = {112876},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.112876},
doi = {10.1016/J.DISC.2022.112876},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ZhangWYNC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GuoHY22,
author = {Shanshan Guo and
Fei Huang and
Jinjiang Yuan},
title = {Properly colored 2-factors of edge-colored complete bipartite graphs},
journal = {Discret. Math.},
volume = {345},
number = {12},
pages = {113094},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.113094},
doi = {10.1016/J.DISC.2022.113094},
timestamp = {Wed, 05 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/GuoHY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ChenGLYZ22,
author = {Rubing Chen and
Zhichao Geng and
Lingfa Lu and
Jinjiang Yuan and
Yuan Zhang},
title = {Pareto-scheduling of two competing agents with their own equal processing
times},
journal = {Eur. J. Oper. Res.},
volume = {301},
number = {2},
pages = {414--431},
year = {2022},
url = {https://doi.org/10.1016/j.ejor.2021.10.064},
doi = {10.1016/J.EJOR.2021.10.064},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/ChenGLYZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MiaoY22,
author = {Runjie Miao and
Jinjiang Yuan},
title = {A note on LP-based approximation algorithms for capacitated facility
location problem},
journal = {Theor. Comput. Sci.},
volume = {932},
pages = {31--40},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.08.002},
doi = {10.1016/J.TCS.2022.08.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MiaoY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/ChenYNC21,
author = {Rubing Chen and
Jinjiang Yuan and
C. T. Ng and
T. C. E. Cheng},
title = {Bicriteria scheduling to minimize total late work and maximum tardiness
with preemption},
journal = {Comput. Ind. Eng.},
volume = {159},
pages = {107525},
year = {2021},
url = {https://doi.org/10.1016/j.cie.2021.107525},
doi = {10.1016/J.CIE.2021.107525},
timestamp = {Tue, 24 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/candie/ChenYNC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenY21a,
author = {Rubing Chen and
Jinjiang Yuan},
title = {Unary NP-hardness of preemptive scheduling to minimize total completion
time with release times and deadlines},
journal = {Discret. Appl. Math.},
volume = {304},
pages = {45--54},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.07.031},
doi = {10.1016/J.DAM.2021.07.031},
timestamp = {Tue, 26 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChenY21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ChenYNC21,
author = {Rubing Chen and
Jinjiang Yuan and
C. T. Ng and
T. C. E. Cheng},
title = {Single-machine hierarchical scheduling with release dates and preemption
to minimize the total completion time and a regular criterion},
journal = {Eur. J. Oper. Res.},
volume = {293},
number = {1},
pages = {79--92},
year = {2021},
url = {https://doi.org/10.1016/j.ejor.2020.12.006},
doi = {10.1016/J.EJOR.2020.12.006},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/ChenYNC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeYNC21,
author = {Ruyan He and
Jinjiang Yuan and
C. T. Ng and
T. C. E. Cheng},
title = {Two-agent preemptive Pareto-scheduling to minimize the number of tardy
jobs and total late work},
journal = {J. Comb. Optim.},
volume = {41},
number = {2},
pages = {504--525},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00697-2},
doi = {10.1007/S10878-021-00697-2},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeYNC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiY21,
author = {Wenjie Li and
Jinjiang Yuan},
title = {Single-machine online scheduling of jobs with non-delayed processing
constraint},
journal = {J. Comb. Optim.},
volume = {41},
number = {4},
pages = {830--843},
year = {2021},
url = {https://doi.org/10.1007/s10878-021-00722-4},
doi = {10.1007/S10878-021-00722-4},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/GaoYNC21,
author = {Yuan Gao and
Jinjiang Yuan and
C. T. Ng and
T. C. E. Cheng},
title = {A note on competing-agent Pareto-scheduling},
journal = {Optim. Lett.},
volume = {15},
number = {1},
pages = {249--262},
year = {2021},
url = {https://doi.org/10.1007/s11590-020-01576-1},
doi = {10.1007/S11590-020-01576-1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/GaoYNC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ZhangY21,
author = {Yuan Zhang and
Jinjiang Yuan},
title = {A note on the complexity of two supply chain scheduling problems},
journal = {J. Sched.},
volume = {24},
number = {4},
pages = {447--454},
year = {2021},
url = {https://doi.org/10.1007/s10951-021-00692-9},
doi = {10.1007/S10951-021-00692-9},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ZhangY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhaoY21,
author = {Qiulan Zhao and
Jinjiang Yuan},
title = {Scheduling to tradeoff between the number and the length of accepted
jobs},
journal = {Theor. Comput. Sci.},
volume = {891},
pages = {24--34},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.08.020},
doi = {10.1016/J.TCS.2021.08.020},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ZhaoY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/ChenY20,
author = {Rubing Chen and
Jinjiang Yuan},
title = {Single-machine scheduling of proportional-linearly deteriorating jobs
with positional due indices},
journal = {4OR},
volume = {18},
number = {2},
pages = {177--196},
year = {2020},
url = {https://doi.org/10.1007/s10288-019-00410-4},
doi = {10.1007/S10288-019-00410-4},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/ChenY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/ChenYG20,
author = {Rubing Chen and
Jinjiang Yuan and
Zhichao Geng},
title = {ND-agent scheduling of linear-deteriorating tasks with positional
due indices to minimize total completion time and maximum cost},
journal = {Appl. Math. Comput.},
volume = {365},
year = {2020},
url = {https://doi.org/10.1016/j.amc.2019.124697},
doi = {10.1016/J.AMC.2019.124697},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/ChenYG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ZouY20,
author = {Juan Zou and
Jinjiang Yuan},
title = {Single-machine scheduling with maintenance activities and rejection},
journal = {Discret. Optim.},
volume = {38},
pages = {100609},
year = {2020},
url = {https://doi.org/10.1016/j.disopt.2020.100609},
doi = {10.1016/J.DISOPT.2020.100609},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/ZouY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/ZhangWY20,
author = {Shanshan Zhang and
Xiumei Wang and
Jinjiang Yuan},
title = {Even cycles and perfect matchings in claw-free plane graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {22},
number = {4},
year = {2020},
url = {https://doi.org/10.23638/DMTCS-22-4-6},
doi = {10.23638/DMTCS-22-4-6},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/ZhangWY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YuanNC20,
author = {Jinjiang Yuan and
Chi To Ng and
T. C. E. Cheng},
title = {Scheduling with release dates and preemption to minimize multiple
max-form objective functions},
journal = {Eur. J. Oper. Res.},
volume = {280},
number = {3},
pages = {860--875},
year = {2020},
url = {https://doi.org/10.1016/j.ejor.2019.07.072},
doi = {10.1016/J.EJOR.2019.07.072},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/YuanNC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhaoY20,
author = {Qiulan Zhao and
Jinjiang Yuan},
title = {Bicriteria scheduling of equal length jobs on uniform parallel machines},
journal = {J. Comb. Optim.},
volume = {39},
number = {3},
pages = {637--661},
year = {2020},
url = {https://doi.org/10.1007/s10878-019-00507-w},
doi = {10.1007/S10878-019-00507-W},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhaoY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/LiY20,
author = {Shi{-}Sheng Li and
Jinjiang Yuan},
title = {Single-machine scheduling with multi-agents to minimize total weighted
late work},
journal = {J. Sched.},
volume = {23},
number = {4},
pages = {497--512},
year = {2020},
url = {https://doi.org/10.1007/s10951-020-00646-7},
doi = {10.1007/S10951-020-00646-7},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/LiY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HuangGY20,
author = {Fei Huang and
Shanshan Guo and
Jinjiang Yuan},
title = {A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {3},
pages = {2009--2015},
year = {2020},
url = {https://doi.org/10.1137/19M1272111},
doi = {10.1137/19M1272111},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HuangGY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/QiY19,
author = {Xianglai Qi and
Jinjiang Yuan},
title = {Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load
Balancing},
journal = {Asia Pac. J. Oper. Res.},
volume = {36},
number = {1},
pages = {1950002:1--1950002:16},
year = {2019},
url = {https://doi.org/10.1142/S0217595919500027},
doi = {10.1142/S0217595919500027},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apjor/QiY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/JiaoYF19,
author = {Chengwen Jiao and
Jinjiang Yuan and
Qi Feng},
title = {Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch
Machines with Linearly Lookahead},
journal = {Asia Pac. J. Oper. Res.},
volume = {36},
number = {5},
pages = {1950024:1--1950024:8},
year = {2019},
url = {https://doi.org/10.1142/S0217595919500246},
doi = {10.1142/S0217595919500246},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apjor/JiaoYF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HuangY19,
author = {Fei Huang and
Jinjiang Yuan},
title = {On strong proper connection number of cubic graphs},
journal = {Discret. Appl. Math.},
volume = {265},
pages = {104--119},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.03.014},
doi = {10.1016/J.DAM.2019.03.014},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HuangY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenHY19,
author = {Xiaozheng Chen and
Fei Huang and
Jinjiang Yuan},
title = {Proper vertex-pancyclicity of edge-colored complete graphs without
monochromatic triangles},
journal = {Discret. Appl. Math.},
volume = {265},
pages = {199--203},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.03.011},
doi = {10.1016/J.DAM.2019.03.011},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenHY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/ChenYL19,
author = {Rubing Chen and
Jinjiang Yuan and
Lingfa Lu},
title = {Single-machine scheduling with positional due indices and positional
deadlines},
journal = {Discret. Optim.},
volume = {34},
year = {2019},
url = {https://doi.org/10.1016/j.disopt.2019.06.002},
doi = {10.1016/J.DISOPT.2019.06.002},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/ChenYL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/GaoYNC19,
author = {Yuan Gao and
Jinjiang Yuan and
Chi To Ng and
T. C. E. Cheng},
title = {A further study on two-agent parallel-batch scheduling with release
dates and deteriorating jobs to minimize the makespan},
journal = {Eur. J. Oper. Res.},
volume = {273},
number = {1},
pages = {74--81},
year = {2019},
url = {https://doi.org/10.1016/j.ejor.2018.07.040},
doi = {10.1016/J.EJOR.2018.07.040},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/GaoYNC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ZhangY19,
author = {Yuan Zhang and
Jinjiang Yuan},
title = {A note on a two-agent scheduling problem related to the total weighted
late work},
journal = {J. Comb. Optim.},
volume = {37},
number = {3},
pages = {989--999},
year = {2019},
url = {https://doi.org/10.1007/s10878-018-0337-z},
doi = {10.1007/S10878-018-0337-Z},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ZhangY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GaoY19,
author = {Yuan Gao and
Jinjiang Yuan},
title = {Unbounded parallel-batch scheduling under agreeable release and processing
to minimize total weighted number of tardy jobs},
journal = {J. Comb. Optim.},
volume = {38},
number = {3},
pages = {698--711},
year = {2019},
url = {https://doi.org/10.1007/s10878-019-00407-z},
doi = {10.1007/S10878-019-00407-Z},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GaoY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/WeiY19,
author = {Hongjun Wei and
Jinjiang Yuan},
title = {Two-machine flow-shop scheduling with equal processing time on the
second machine for minimizing total weighted completion time},
journal = {Oper. Res. Lett.},
volume = {47},
number = {1},
pages = {41--46},
year = {2019},
url = {https://doi.org/10.1016/j.orl.2018.12.002},
doi = {10.1016/J.ORL.2018.12.002},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/WeiY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ZhaoY19,
author = {Qiulan Zhao and
Jinjiang Yuan},
title = {A note on single-machine scheduling to tradeoff between the number
of tardy jobs and the start time of machine},
journal = {Oper. Res. Lett.},
volume = {47},
number = {6},
pages = {607--610},
year = {2019},
url = {https://doi.org/10.1016/j.orl.2019.10.009},
doi = {10.1016/J.ORL.2019.10.009},
timestamp = {Thu, 19 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/ZhaoY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/GaoYW19,
author = {Yuan Gao and
Jinjiang Yuan and
Zhigang Wei},
title = {Unbounded parallel-batch scheduling with drop-line tasks},
journal = {J. Sched.},
volume = {22},
number = {4},
pages = {449--463},
year = {2019},
url = {https://doi.org/10.1007/s10951-018-0586-9},
doi = {10.1007/S10951-018-0586-9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/GaoYW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChenYG19,
author = {Rubing Chen and
Jinjiang Yuan and
Yuan Gao},
title = {The complexity of CO-agent scheduling to minimize the total completion
time and total number of tardy jobs},
journal = {J. Sched.},
volume = {22},
number = {5},
pages = {581--593},
year = {2019},
url = {https://doi.org/10.1007/s10951-018-0598-5},
doi = {10.1007/S10951-018-0598-5},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ChenYG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChenY19,
author = {Rubing Chen and
Jinjiang Yuan},
title = {Unary NP-hardness of single-machine scheduling to minimize the total
tardiness with deadlines},
journal = {J. Sched.},
volume = {22},
number = {5},
pages = {595--601},
year = {2019},
url = {https://doi.org/10.1007/s10951-019-00615-9},
doi = {10.1007/S10951-019-00615-9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ChenY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MiaoYH19,
author = {Runjie Miao and
Jinjiang Yuan and
Fei Huang},
title = {Paths and trails in edge-colored weighted graphs},
journal = {Theor. Comput. Sci.},
volume = {799},
pages = {104--114},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.09.048},
doi = {10.1016/J.TCS.2019.09.048},
timestamp = {Wed, 20 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MiaoYH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/GengYY18,
author = {Zhichao Geng and
Jinjiang Yuan and
Junling Yuan},
title = {Scheduling with or without precedence relations on a serial-batch
machine to minimize makespan and maximum cost},
journal = {Appl. Math. Comput.},
volume = {332},
pages = {1--18},
year = {2018},
url = {https://doi.org/10.1016/j.amc.2018.03.001},
doi = {10.1016/J.AMC.2018.03.001},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/GengYY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/LiuY18,
author = {Qijia Liu and
Jinjiang Yuan},
title = {Online Scheduling of Incompatible Family Jobs with Equal Length on
an Unbounded Parallel-Batch Machine with Job Delivery},
journal = {Asia Pac. J. Oper. Res.},
volume = {35},
number = {4},
pages = {1850026:1--1850026:12},
year = {2018},
url = {https://doi.org/10.1142/S0217595918500264},
doi = {10.1142/S0217595918500264},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apjor/LiuY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/WanY18,
author = {Long Wan and
Jinjiang Yuan},
title = {Single-machine scheduling with operator non-availability to minimize
total weighted completion time},
journal = {Inf. Sci.},
volume = {445-446},
pages = {1--5},
year = {2018},
url = {https://doi.org/10.1016/j.ins.2018.03.005},
doi = {10.1016/J.INS.2018.03.005},
timestamp = {Thu, 19 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/isci/WanY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/Yuan18,
author = {Jinjiang Yuan},
title = {Complexities of four problems on two-agent scheduling},
journal = {Optim. Lett.},
volume = {12},
number = {4},
pages = {763--780},
year = {2018},
url = {https://doi.org/10.1007/s11590-017-1141-x},
doi = {10.1007/S11590-017-1141-X},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/Yuan18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/QiY17,
author = {Xianglai Qi and
Jinjiang Yuan},
title = {Semi-online hierarchical scheduling for {\textdollar}{\textdollar}l{\_}p{\textdollar}{\textdollar}
l p -norm load balancing with buffer or rearrangements},
journal = {4OR},
volume = {15},
number = {3},
pages = {265--276},
year = {2017},
url = {https://doi.org/10.1007/s10288-016-0334-y},
doi = {10.1007/S10288-016-0334-Y},
timestamp = {Tue, 05 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/QiY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/ZhaoY17,
author = {Qiulan Zhao and
Jinjiang Yuan},
title = {Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions
of Original Jobs},
journal = {Asia Pac. J. Oper. Res.},
volume = {34},
number = {5},
pages = {1750024:1--1750024:12},
year = {2017},
url = {https://doi.org/10.1142/S0217595917500245},
doi = {10.1142/S0217595917500245},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apjor/ZhaoY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/candie/QiY17,
author = {Xianglai Qi and
Jinjiang Yuan},
title = {A further study on two-agent scheduling on an unbounded serial-batch
machine with batch delivery cost},
journal = {Comput. Ind. Eng.},
volume = {111},
pages = {458--462},
year = {2017},
url = {https://doi.org/10.1016/j.cie.2017.07.029},
doi = {10.1016/J.CIE.2017.07.029},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/candie/QiY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/GaoY17,
author = {Yuan Gao and
Jinjiang Yuan},
title = {Bi-criteria Pareto-scheduling on a single machine with due indices
and precedence constraints},
journal = {Discret. Optim.},
volume = {25},
pages = {105--119},
year = {2017},
url = {https://doi.org/10.1016/j.disopt.2017.02.004},
doi = {10.1016/J.DISOPT.2017.02.004},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/GaoY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fgcs/WanWXYX17,
author = {Long Wan and
Lijun Wei and
Naixue Xiong and
Jinjiang Yuan and
Jiacai Xiong},
title = {Pareto optimization for the two-agent scheduling problems with linear
non-increasing deterioration based on Internet of Things},
journal = {Future Gener. Comput. Syst.},
volume = {76},
pages = {293--300},
year = {2017},
url = {https://doi.org/10.1016/j.future.2016.09.004},
doi = {10.1016/J.FUTURE.2016.09.004},
timestamp = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fgcs/WanWXYX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Yuan17,
author = {Jinjiang Yuan},
title = {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},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {433--440},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0078-9},
doi = {10.1007/S10878-016-0078-9},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Yuan17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/MaY17,
author = {Ran Ma and
Jinjiang Yuan},
title = {Online scheduling to minimize the total weighted completion time plus
the rejection cost},
journal = {J. Comb. Optim.},
volume = {34},
number = {2},
pages = {483--503},
year = {2017},
url = {https://doi.org/10.1007/s10878-016-0083-z},
doi = {10.1007/S10878-016-0083-Z},
timestamp = {Wed, 19 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/MaY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/FuTLY17,
author = {Ruyan Fu and
Ji Tian and
Shisheng Li and
Jinjiang Yuan},
title = {An optimal online algorithm for the parallel-batch scheduling with
job processing time compatibilities},
journal = {J. Comb. Optim.},
volume = {34},
number = {4},
pages = {1187--1197},
year = {2017},
url = {https://doi.org/10.1007/s10878-017-0139-8},
doi = {10.1007/S10878-017-0139-8},
timestamp = {Tue, 07 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/FuTLY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/Yuan17,
author = {Jinjiang Yuan},
title = {Unary NP-hardness of minimizing the number of tardy jobs with deadlines},
journal = {J. Sched.},
volume = {20},
number = {2},
pages = {211--218},
year = {2017},
url = {https://doi.org/10.1007/s10951-016-0479-8},
doi = {10.1007/S10951-016-0479-8},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/Yuan17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/ZhaoLY16,
author = {Qiulan Zhao and
Lingfa Lu and
Jinjiang Yuan},
title = {Rescheduling with new orders and general maximum allowable time disruptions},
journal = {4OR},
volume = {14},
number = {3},
pages = {261--280},
year = {2016},
url = {https://doi.org/10.1007/s10288-016-0308-0},
doi = {10.1007/S10288-016-0308-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/ZhaoLY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/MaTY16,
author = {Ran Ma and
Jiping Tao and
Jinjiang Yuan},
title = {Online scheduling with linear deteriorating jobs to minimize the total
weighted completion time},
journal = {Appl. Math. Comput.},
volume = {273},
pages = {570--583},
year = {2016},
url = {https://doi.org/10.1016/j.amc.2015.10.058},
doi = {10.1016/J.AMC.2015.10.058},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/MaTY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/WanYW16,
author = {Long Wan and
Jinjiang Yuan and
Lijun Wei},
title = {Pareto optimization scheduling with two competing agents to minimize
the number of tardy jobs and the maximum cost},
journal = {Appl. Math. Comput.},
volume = {273},
pages = {912--923},
year = {2016},
url = {https://doi.org/10.1016/j.amc.2015.10.059},
doi = {10.1016/J.AMC.2015.10.059},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/WanYW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuYL16,
author = {Hailing Liu and
Jinjiang Yuan and
Wenjie Li},
title = {Online scheduling of equal length jobs on unbounded parallel batch
processing machines with limited restart},
journal = {J. Comb. Optim.},
volume = {31},
number = {4},
pages = {1609--1622},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9844-3},
doi = {10.1007/S10878-015-9844-3},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuYL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiuY16,
author = {Qijia Liu and
Jinjiang Yuan},
title = {Online tradeoff scheduling on a single machine to minimize makespan
and maximum lateness},
journal = {J. Comb. Optim.},
volume = {32},
number = {2},
pages = {385--395},
year = {2016},
url = {https://doi.org/10.1007/s10878-015-9918-2},
doi = {10.1007/S10878-015-9918-2},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiuY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/LiY16,
author = {Wenjie Li and
Jinjiang Yuan},
title = {{LPT} online strategy for parallel-machine scheduling with kind release
times},
journal = {Optim. Lett.},
volume = {10},
number = {1},
pages = {159--168},
year = {2016},
url = {https://doi.org/10.1007/s11590-015-0862-y},
doi = {10.1007/S11590-015-0862-Y},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/LiY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GaoY16,
author = {Yuan Gao and
Jinjiang Yuan},
title = {Unary NP-hardness of minimizing total weighted tardiness with generalized
due dates},
journal = {Oper. Res. Lett.},
volume = {44},
number = {1},
pages = {92--95},
year = {2016},
url = {https://doi.org/10.1016/j.orl.2015.12.006},
doi = {10.1016/J.ORL.2015.12.006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GaoY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ors/ZhangLY16,
author = {Liqi Zhang and
Lingfa Lu and
Jinjiang Yuan},
title = {Two-machine open-shop scheduling with rejection to minimize the makespan},
journal = {{OR} Spectr.},
volume = {38},
number = {2},
pages = {519--529},
year = {2016},
url = {https://doi.org/10.1007/s00291-015-0409-8},
doi = {10.1007/S00291-015-0409-8},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ors/ZhangLY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TianWFY16,
author = {Ji Tian and
Qian Wang and
Ruyan Fu and
Jinjiang Yuan},
title = {Online scheduling on the unbounded drop-line batch machines to minimize
the maximum delivery completion time},
journal = {Theor. Comput. Sci.},
volume = {617},
pages = {65--68},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.01.001},
doi = {10.1016/J.TCS.2016.01.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TianWFY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenLY16,
author = {Youjun Chen and
Lingfa Lu and
Jinjiang Yuan},
title = {Two-stage scheduling on identical machines with assignable delivery
times to minimize the maximum delivery completion time},
journal = {Theor. Comput. Sci.},
volume = {622},
pages = {45--65},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.01.044},
doi = {10.1016/J.TCS.2016.01.044},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChenLY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/LiGY15,
author = {Wenhua Li and
Jie Gao and
Jinjiang Yuan},
title = {Online-List Scheduling on a Single Bounded Parallel-Batch Machine
to Minimize Makespan},
journal = {Asia Pac. J. Oper. Res.},
volume = {32},
number = {4},
pages = {1550028:1--1550028:15},
year = {2015},
url = {https://doi.org/10.1142/S0217595915500281},
doi = {10.1142/S0217595915500281},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apjor/LiGY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/LiY15,
author = {Wenjie Li and
Jinjiang Yuan},
title = {An Improved Online Algorithm for the Online Preemptive Scheduling
of Equal-Length Intervals on a Single Machine with Lookahead},
journal = {Asia Pac. J. Oper. Res.},
volume = {32},
number = {6},
pages = {1550047:1--1550047:9},
year = {2015},
url = {https://doi.org/10.1142/S0217595915500475},
doi = {10.1142/S0217595915500475},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apjor/LiY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GaoY15,
author = {Yuan Gao and
Jinjiang Yuan},
title = {Unary NP-hardness of minimizing the total deviation with generalized
or assignable due dates},
journal = {Discret. Appl. Math.},
volume = {189},
pages = {49--52},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.03.011},
doi = {10.1016/J.DAM.2015.03.011},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GaoY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/WangSY15,
author = {Xiumei Wang and
Weiping Shang and
Jinjiang Yuan},
title = {On Graphs with a Unique Perfect Matching},
journal = {Graphs Comb.},
volume = {31},
number = {5},
pages = {1765--1777},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1463-8},
doi = {10.1007/S00373-014-1463-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/WangSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GengY15,
author = {Zhichao Geng and
Jinjiang Yuan},
title = {A note on unbounded parallel-batch scheduling},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {969--974},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.002},
doi = {10.1016/J.IPL.2015.07.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GengY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/GaoY15,
author = {Yuan Gao and
Jinjiang Yuan},
title = {A note on Pareto minimizing total completion time and maximum cost},
journal = {Oper. Res. Lett.},
volume = {43},
number = {1},
pages = {80--82},
year = {2015},
url = {https://doi.org/10.1016/j.orl.2014.12.001},
doi = {10.1016/J.ORL.2014.12.001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/GaoY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/YuanNC15,
author = {Jinjiang Yuan and
C. T. Ng and
T. C. Edwin Cheng},
title = {Two-agent single-machine scheduling with release dates and preemption
to minimize the maximum lateness},
journal = {J. Sched.},
volume = {18},
number = {2},
pages = {147--153},
year = {2015},
url = {https://doi.org/10.1007/s10951-013-0360-y},
doi = {10.1007/S10951-013-0360-Y},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/YuanNC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/WanYG15,
author = {Long Wan and
Jinjiang Yuan and
Zhichao Geng},
title = {A note on the preemptive scheduling to minimize total completion time
with release time and deadline constraints},
journal = {J. Sched.},
volume = {18},
number = {3},
pages = {315--323},
year = {2015},
url = {https://doi.org/10.1007/s10951-014-0368-y},
doi = {10.1007/S10951-014-0368-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/WanYG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GengY15,
author = {Zhichao Geng and
Jinjiang Yuan},
title = {Pareto optimization scheduling of family jobs on a p-batch machine
to minimize makespan and maximum lateness},
journal = {Theor. Comput. Sci.},
volume = {570},
pages = {22--29},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.12.020},
doi = {10.1016/J.TCS.2014.12.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GengY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiCNY15,
author = {Shisheng Li and
T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Single-machine batch scheduling with job processing time compatibility},
journal = {Theor. Comput. Sci.},
volume = {583},
pages = {57--66},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.03.043},
doi = {10.1016/J.TCS.2015.03.043},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiCNY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenLY15,
author = {Youjun Chen and
Lingfa Lu and
Jinjiang Yuan},
title = {Preemptive scheduling on identical machines with delivery coordination
to minimize the maximum delivery completion time},
journal = {Theor. Comput. Sci.},
volume = {583},
pages = {67--77},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.03.046},
doi = {10.1016/J.TCS.2015.03.046},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChenLY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/HeLYM14,
author = {Cheng He and
Hao Lin and
Jinjiang Yuan and
Yundong Mu},
title = {Batching Machine Scheduling with bicriteria: Maximum Cost and makespan},
journal = {Asia Pac. J. Oper. Res.},
volume = {31},
number = {4},
year = {2014},
url = {https://doi.org/10.1142/S0217595914500250},
doi = {10.1142/S0217595914500250},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/HeLYM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/JiaoLY14,
author = {Chengwen Jiao and
Wenhua Li and
Jinjiang Yuan},
title = {A Best Possible Online Algorithm for Scheduling to minimize Maximum
Flow-Time on Bounded batch Machines},
journal = {Asia Pac. J. Oper. Res.},
volume = {31},
number = {4},
year = {2014},
url = {https://doi.org/10.1142/S0217595914500304},
doi = {10.1142/S0217595914500304},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/JiaoLY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HuangWY14,
author = {Fei Huang and
Xiumei Wang and
Jinjiang Yuan},
title = {On the vertex-arboricity of K\({}_{\mbox{5}}\)-minor-free graphs of
diameter 2},
journal = {Discret. Math.},
volume = {322},
pages = {1--4},
year = {2014},
url = {https://doi.org/10.1016/j.disc.2013.12.017},
doi = {10.1016/J.DISC.2013.12.017},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HuangWY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FuTYL14,
author = {Ruyan Fu and
Ji Tian and
Jinjiang Yuan and
Ya Li},
title = {Online scheduling on an unbounded parallel-batch machine and a standard
machine to minimize makespan},
journal = {Inf. Process. Lett.},
volume = {114},
number = {4},
pages = {179--184},
year = {2014},
url = {https://doi.org/10.1016/j.ipl.2013.11.016},
doi = {10.1016/J.IPL.2013.11.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FuTYL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/WangSY14,
author = {Xiumei Wang and
Xiaoxin Song and
Jinjiang Yuan},
title = {On matching cover of graphs},
journal = {Math. Program.},
volume = {147},
number = {1-2},
pages = {499--518},
year = {2014},
url = {https://doi.org/10.1007/s10107-013-0731-3},
doi = {10.1007/S10107-013-0731-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/WangSY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/LiY14,
author = {Wenjie Li and
Jinjiang Yuan},
title = {Improved online algorithms for the batch scheduling of equal-length
jobs with incompatible families to maximize the weighted number of
early jobs},
journal = {Optim. Lett.},
volume = {8},
number = {5},
pages = {1691--1706},
year = {2014},
url = {https://doi.org/10.1007/s11590-013-0650-5},
doi = {10.1007/S11590-013-0650-5},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/LiY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WanMY14,
author = {Long Wan and
Ran Ma and
Jinjiang Yuan},
title = {Primary-secondary bicriteria scheduling on identical machines to minimize
the total completion time of all jobs and the maximum T-time of all
machines},
journal = {Theor. Comput. Sci.},
volume = {518},
pages = {117--123},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.05.034},
doi = {10.1016/J.TCS.2013.05.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WanMY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuY14,
author = {Hailing Liu and
Jinjiang Yuan},
title = {Online scheduling of equal length jobs on a bounded parallel batch
machine with restart or limited restart},
journal = {Theor. Comput. Sci.},
volume = {543},
pages = {24--36},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.05.021},
doi = {10.1016/J.TCS.2014.05.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiYY14,
author = {Wenhua Li and
Jinjiang Yuan and
Sufang Yang},
title = {Online scheduling of incompatible unit-length job families with lookahead},
journal = {Theor. Comput. Sci.},
volume = {543},
pages = {120--125},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.05.024},
doi = {10.1016/J.TCS.2014.05.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiYY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/LiuJY13,
author = {Ruifang Liu and
Huicai Jia and
Jinjiang Yuan},
title = {Tree with minimal Laplacian spectral radius and diameter n-4},
journal = {Ars Comb.},
volume = {109},
pages = {345--352},
year = {2013},
timestamp = {Mon, 03 Jun 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/LiuJY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MaY13,
author = {Ran Ma and
Jinjiang Yuan},
title = {Online scheduling on a single machine with rejection under an agreeable
condition to minimize the total completion time plus the total rejection
cost},
journal = {Inf. Process. Lett.},
volume = {113},
number = {17},
pages = {593--598},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.05.006},
doi = {10.1016/J.IPL.2013.05.006},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MaY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FuCNY13,
author = {Ruyan Fu and
T. C. E. Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {An optimal online algorithm for single parallel-batch machine scheduling
with incompatible job families to minimize makespan},
journal = {Oper. Res. Lett.},
volume = {41},
number = {3},
pages = {216--219},
year = {2013},
url = {https://doi.org/10.1016/j.orl.2013.01.003},
doi = {10.1016/J.ORL.2013.01.003},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/FuCNY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/WanY13,
author = {Long Wan and
Jinjiang Yuan},
title = {Single-machine scheduling to minimize the total earliness and tardiness
is strongly NP-hard},
journal = {Oper. Res. Lett.},
volume = {41},
number = {4},
pages = {363--365},
year = {2013},
url = {https://doi.org/10.1016/j.orl.2013.04.007},
doi = {10.1016/J.ORL.2013.04.007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/WanY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ZhaoY13,
author = {Qiulan Zhao and
Jinjiang Yuan},
title = {Pareto optimization of rescheduling with release dates to minimize
makespan and total sequence disruption},
journal = {J. Sched.},
volume = {16},
number = {3},
pages = {253--260},
year = {2013},
url = {https://doi.org/10.1007/s10951-013-0311-7},
doi = {10.1007/S10951-013-0311-7},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ZhaoY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/LiBNCSY13,
author = {S. S. Li and
Peter Brucker and
Chi To Ng and
T. C. Edwin Cheng and
Natalia V. Shakhlevich and
Jinjiang Yuan},
title = {A note on reverse scheduling with maximum lateness objective},
journal = {J. Sched.},
volume = {16},
number = {4},
pages = {417--422},
year = {2013},
url = {https://doi.org/10.1007/s10951-013-0314-4},
doi = {10.1007/S10951-013-0314-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/LiBNCSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/TianCNY12,
author = {Ji Tian and
T. C. E. Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {An improved on-line algorithm for single parallel-batch machine scheduling
with delivery times},
journal = {Discret. Appl. Math.},
volume = {160},
number = {7-8},
pages = {1191--1210},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.12.002},
doi = {10.1016/J.DAM.2011.12.002},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/TianCNY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiZLY12,
author = {Wenjie Li and
Zhenkun Zhang and
Hailing Liu and
Jinjiang Yuan},
title = {Online scheduling of equal-length jobs with incompatible families
on multiple batch machines to maximize the weighted number of early
jobs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {12},
pages = {503--508},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.015},
doi = {10.1016/J.IPL.2012.03.015},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiZLY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/LiY12,
author = {Shisheng Li and
Jinjiang Yuan},
title = {Unbounded parallel-batching scheduling with two competitive agents},
journal = {J. Sched.},
volume = {15},
number = {5},
pages = {629--640},
year = {2012},
url = {https://doi.org/10.1007/s10951-011-0253-x},
doi = {10.1007/S10951-011-0253-X},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/LiY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YuanLY12,
author = {Junling Yuan and
Wenhua Li and
Jinjiang Yuan},
title = {A best possible online algorithm for scheduling equal-length jobs
on two machines with chain precedence constraints},
journal = {Theor. Comput. Sci.},
volume = {457},
pages = {174--180},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.07.009},
doi = {10.1016/J.TCS.2012.07.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YuanLY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YuanNC11,
author = {Jinjiang Yuan and
C. T. Ng and
T. C. Edwin Cheng},
title = {Best semi-online algorithms for unbounded parallel batch scheduling},
journal = {Discret. Appl. Math.},
volume = {159},
number = {8},
pages = {838--847},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.01.003},
doi = {10.1016/J.DAM.2011.01.003},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YuanNC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LiNCY11,
author = {Shisheng Li and
C. T. Ng and
T. C. Edwin Cheng and
Jinjiang Yuan},
title = {Parallel-batch scheduling of deteriorating jobs with release dates
to minimize the makespan},
journal = {Eur. J. Oper. Res.},
volume = {210},
number = {3},
pages = {482--488},
year = {2011},
url = {https://doi.org/10.1016/j.ejor.2010.11.021},
doi = {10.1016/J.EJOR.2010.11.021},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/LiNCY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijsysc/CaoYLB11,
author = {Jianfa Cao and
Jinjiang Yuan and
Wenjie Li and
Hailin Bu},
title = {Online scheduling on batching machines to minimise the total weighted
completion time of jobs with precedence constraints and identical
processing times},
journal = {Int. J. Syst. Sci.},
volume = {42},
number = {1},
pages = {51--55},
year = {2011},
url = {https://doi.org/10.1080/00207720903428906},
doi = {10.1080/00207720903428906},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijsysc/CaoYLB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiYF11,
author = {Shisheng Li and
Jinjiang Yuan and
Baoqiang Fan},
title = {Unbounded parallel-batch scheduling with family jobs and delivery
coordination},
journal = {Inf. Process. Lett.},
volume = {111},
number = {12},
pages = {575--582},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.03.014},
doi = {10.1016/J.IPL.2011.03.014},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiYF11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LiY11,
author = {Wenhua Li and
Jinjiang Yuan},
title = {Online scheduling on unbounded parallel-batch machines to minimize
maximum flow-time},
journal = {Inf. Process. Lett.},
volume = {111},
number = {18},
pages = {907--911},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.06.008},
doi = {10.1016/J.IPL.2011.06.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LiY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TianFY11,
author = {Ji Tian and
Ruyan Fu and
Jinjiang Yuan},
title = {An on-line algorithm for the single machine unbounded parallel-batching
scheduling with large delivery times},
journal = {Inf. Process. Lett.},
volume = {111},
number = {21-22},
pages = {1048--1053},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.08.003},
doi = {10.1016/J.IPL.2011.08.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/TianFY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/YuanFNC11,
author = {Jinjiang Yuan and
Ruyan Fu and
C. T. Ng and
T. C. Edwin Cheng},
title = {A best online algorithm for unbounded parallel-batch scheduling with
restarts to minimize makespan},
journal = {J. Sched.},
volume = {14},
number = {4},
pages = {361--369},
year = {2011},
url = {https://doi.org/10.1007/s10951-010-0172-2},
doi = {10.1007/S10951-010-0172-2},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/YuanFNC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TianCNY11,
author = {Ji Tian and
T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Online scheduling on unbounded parallel-batch machines with incompatible
job families},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {22},
pages = {2380--2386},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.023},
doi = {10.1016/J.TCS.2011.01.023},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TianCNY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/HeLY10,
author = {Cheng He and
Yixun Lin and
Jinjiang Yuan},
title = {Some Improved Algorithms on the Single Machine Hierarchical Scheduling
with Total tardiness as the Primary Criterion},
journal = {Asia Pac. J. Oper. Res.},
volume = {27},
number = {5},
pages = {577--585},
year = {2010},
url = {https://doi.org/10.1142/S0217595910002867},
doi = {10.1142/S0217595910002867},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/HeLY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/HeLY10a,
author = {Cheng He and
Yixun Lin and
Jinjiang Yuan},
title = {A note on the single machine scheduling to minimize the number of
tardy jobs with deadlines},
journal = {Eur. J. Oper. Res.},
volume = {201},
number = {3},
pages = {966--970},
year = {2010},
url = {https://doi.org/10.1016/j.ejor.2009.05.013},
doi = {10.1016/J.EJOR.2009.05.013},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/HeLY10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FuCNY10,
author = {Ruyan Fu and
T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Online scheduling on two parallel-batching machines with limited restarts
to minimize the makespan},
journal = {Inf. Process. Lett.},
volume = {110},
number = {11},
pages = {444--450},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.04.008},
doi = {10.1016/J.IPL.2010.04.008},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FuCNY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiY10,
author = {Shisheng Li and
Jinjiang Yuan},
title = {Parallel-machine parallel-batching scheduling with family jobs and
release dates to minimize makespan},
journal = {J. Comb. Optim.},
volume = {19},
number = {1},
pages = {84--93},
year = {2010},
url = {https://doi.org/10.1007/s10878-008-9163-z},
doi = {10.1007/S10878-008-9163-Z},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZhangLY10,
author = {Liqi Zhang and
Lingfa Lu and
Jinjiang Yuan},
title = {Single-machine scheduling under the job rejection constraint},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {16-18},
pages = {1877--1882},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.02.006},
doi = {10.1016/J.TCS.2010.02.006},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ZhangLY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NgLCY10,
author = {C. T. Ng and
Shisheng Li and
T. C. Edwin Cheng and
Jinjiang Yuan},
title = {Preemptive scheduling with simple linear deterioration on a single
machine},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {40-42},
pages = {3578--3586},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.05.032},
doi = {10.1016/J.TCS.2010.05.032},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NgLCY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiY10,
author = {Shisheng Li and
Jinjiang Yuan},
title = {Parallel-machine scheduling with deteriorating jobs and rejection},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {40-42},
pages = {3642--3650},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.06.008},
doi = {10.1016/J.TCS.2010.06.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/LuCYZ09,
author = {Lingfa Lu and
T. C. Edwin Cheng and
Jinjiang Yuan and
Liqi Zhang},
title = {Bounded single-machine parallel-batch scheduling with release dates
and rejection},
journal = {Comput. Oper. Res.},
volume = {36},
number = {10},
pages = {2748--2751},
year = {2009},
url = {https://doi.org/10.1016/j.cor.2008.12.003},
doi = {10.1016/J.COR.2008.12.003},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/LuCYZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/WangYZ09,
author = {Xiumei Wang and
Jinjiang Yuan and
Sujing Zhou},
title = {Edge-deletable IM-extendable graphs with minimum number of edges},
journal = {Discret. Math.},
volume = {309},
number = {16},
pages = {5242--5247},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2009.03.048},
doi = {10.1016/J.DISC.2009.03.048},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/WangYZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ZhangLY09,
author = {Liqi Zhang and
Lingfa Lu and
Jinjiang Yuan},
title = {Single machine scheduling with release dates and rejection},
journal = {Eur. J. Oper. Res.},
volume = {198},
number = {3},
pages = {975--978},
year = {2009},
url = {https://doi.org/10.1016/j.ejor.2008.10.006},
doi = {10.1016/J.EJOR.2008.10.006},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/ZhangLY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HeLY09,
author = {Cheng He and
Yixun Lin and
Jinjiang Yuan},
title = {A {DP} algorithm for minimizing makespan and total completion time
on a series-batching machine},
journal = {Inf. Process. Lett.},
volume = {109},
number = {12},
pages = {603--607},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.02.007},
doi = {10.1016/J.IPL.2009.02.007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HeLY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/TianCNY09,
author = {Ji Tian and
T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Online scheduling on unbounded parallel-batch machines to minimize
the makespan},
journal = {Inf. Process. Lett.},
volume = {109},
number = {21-22},
pages = {1211--1215},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.08.008},
doi = {10.1016/J.IPL.2009.08.008},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/TianCNY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/YuanLTF09,
author = {Jinjiang Yuan and
Shisheng Li and
Ji Tian and
Ruyan Fu},
title = {A best on-line algorithm for the single machine parallel-batch scheduling
with restricted delivery times},
journal = {J. Comb. Optim.},
volume = {17},
number = {2},
pages = {206--213},
year = {2009},
url = {https://doi.org/10.1007/s10878-007-9108-y},
doi = {10.1007/S10878-007-9108-Y},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/YuanLTF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NongYL09,
author = {Qingqin Nong and
Jinjiang Yuan and
Yixun Lin},
title = {The weighted link ring loading problem},
journal = {J. Comb. Optim.},
volume = {18},
number = {1},
pages = {38--50},
year = {2009},
url = {https://doi.org/10.1007/s10878-007-9136-7},
doi = {10.1007/S10878-007-9136-7},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/NongYL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/FuTY09,
author = {Ruyan Fu and
Ji Tian and
Jinjiang Yuan},
title = {On-line scheduling on an unbounded parallel batch machine to minimize
makespan of two families of jobs},
journal = {J. Sched.},
volume = {12},
number = {1},
pages = {91--97},
year = {2009},
url = {https://doi.org/10.1007/s10951-008-0084-6},
doi = {10.1007/S10951-008-0084-6},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/FuTY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/QiZY09,
author = {Xianglai Qi and
Shiguo Zhou and
Jinjiang Yuan},
title = {Single machine parallel-batch scheduling with deteriorating jobs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {8-10},
pages = {830--836},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.11.009},
doi = {10.1016/J.TCS.2008.11.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/QiZY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TianFY09,
author = {Ji Tian and
Ruyan Fu and
Jinjiang Yuan},
title = {A best online algorithm for scheduling on two parallel batch machines},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2291--2294},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.011},
doi = {10.1016/J.TCS.2009.02.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TianFY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiY09,
author = {Shisheng Li and
Jinjiang Yuan},
title = {Scheduling with families of jobs and delivery coordination under job
availability},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {4856--4863},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.025},
doi = {10.1016/J.TCS.2009.06.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiYCB09,
author = {Wenjie Li and
Jinjiang Yuan and
Jianfa Cao and
Hailin Bu},
title = {Online scheduling of unit length jobs on a batching machine to maximize
the number of early jobs with lookahead},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {47-49},
pages = {5182--5187},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.056},
doi = {10.1016/J.TCS.2009.07.056},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiYCB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/LuY08,
author = {Lingfa Lu and
Jinjiang Yuan},
title = {Single Machine Scheduling with Job Delivery to minimize makespan},
journal = {Asia Pac. J. Oper. Res.},
volume = {25},
number = {1},
pages = {1--10},
year = {2008},
url = {https://doi.org/10.1142/S0217595908001596},
doi = {10.1142/S0217595908001596},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/LuY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/YuanSO08,
author = {Jinjiang Yuan and
Lei Shi and
Jinwen Ou},
title = {Single Machine Scheduling with Forbidden Intervals and Job Delivery
Times},
journal = {Asia Pac. J. Oper. Res.},
volume = {25},
number = {3},
pages = {317--325},
year = {2008},
url = {https://doi.org/10.1142/S0217595908001778},
doi = {10.1142/S0217595908001778},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/YuanSO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YuanQLL08,
author = {Jinjiang Yuan and
Xianglai Qi and
Lingfa Lu and
Wenhua Li},
title = {Single machine unbounded parallel-batch scheduling with forbidden
intervals},
journal = {Eur. J. Oper. Res.},
volume = {186},
number = {3},
pages = {1212--1217},
year = {2008},
url = {https://doi.org/10.1016/j.ejor.2007.02.051},
doi = {10.1016/J.EJOR.2007.02.051},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/YuanQLL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ChengNY08,
author = {T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Multi-agent scheduling on a single machine with max-form criteria},
journal = {Eur. J. Oper. Res.},
volume = {188},
number = {2},
pages = {603--609},
year = {2008},
url = {https://doi.org/10.1016/j.ejor.2007.04.040},
doi = {10.1016/J.EJOR.2007.04.040},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/ChengNY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ChengNY08a,
author = {T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Single-machine scheduling of multi-operation jobs without missing
operations to minimize the total completion time},
journal = {Eur. J. Oper. Res.},
volume = {191},
number = {2},
pages = {320--331},
year = {2008},
url = {https://doi.org/10.1016/j.ejor.2007.08.019},
doi = {10.1016/J.EJOR.2007.08.019},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/ChengNY08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/WangYZ08,
author = {Qin Wang and
Jinjiang Yuan and
Jianzhong Zhang},
title = {An inverse model for the most uniform problem},
journal = {Oper. Res. Lett.},
volume = {36},
number = {1},
pages = {26--30},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.03.006},
doi = {10.1016/J.ORL.2007.03.006},
timestamp = {Sat, 02 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/WangYZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/FuTYH08,
author = {Ruyan Fu and
Ji Tian and
Jinjiang Yuan and
Cheng He},
title = {On-line scheduling on a batch machine to minimize makespan with limited
restarts},
journal = {Oper. Res. Lett.},
volume = {36},
number = {2},
pages = {255--258},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.07.001},
doi = {10.1016/J.ORL.2007.07.001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/FuTYH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LuY08,
author = {Lingfa Lu and
Jinjiang Yuan},
title = {Unbounded parallel batch scheduling with job delivery to minimize
makespan},
journal = {Oper. Res. Lett.},
volume = {36},
number = {4},
pages = {477--480},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2008.01.006},
doi = {10.1016/J.ORL.2008.01.006},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/LuY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LuYZ08,
author = {Lingfa Lu and
Jinjiang Yuan and
Liqi Zhang},
title = {Single machine scheduling with release dates and job delivery to minimize
the makespan},
journal = {Theor. Comput. Sci.},
volume = {393},
number = {1-3},
pages = {102--108},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2007.11.008},
doi = {10.1016/J.TCS.2007.11.008},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LuYZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TianFY08,
author = {Ji Tian and
Ruyan Fu and
Jinjiang Yuan},
title = {A best on-line algorithm for single machine scheduling with small
delivery times},
journal = {Theor. Comput. Sci.},
volume = {393},
number = {1-3},
pages = {287--293},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2007.11.006},
doi = {10.1016/J.TCS.2007.11.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TianFY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LuZY08,
author = {Lingfa Lu and
Liqi Zhang and
Jinjiang Yuan},
title = {The unbounded parallel batch machine scheduling with release dates
and rejection to minimize makespan},
journal = {Theor. Comput. Sci.},
volume = {396},
number = {1-3},
pages = {283--289},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.02.015},
doi = {10.1016/J.TCS.2008.02.015},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LuZY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apjor/YuanMLL07,
author = {Jinjiang Yuan and
Yundong Mu and
Lingfa Lu and
Wenhua Li},
title = {Rescheduling with Release dates to minimize Total Sequence Disruption
under a Limit on the makespan},
journal = {Asia Pac. J. Oper. Res.},
volume = {24},
number = {6},
pages = {789--796},
year = {2007},
url = {https://doi.org/10.1142/S021759590700153X},
doi = {10.1142/S021759590700153X},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apjor/YuanMLL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhangY07,
author = {Zhao Zhang and
Jinjiang Yuan},
title = {Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity
to be optimal},
journal = {Discret. Math.},
volume = {307},
number = {2},
pages = {293--298},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2006.06.028},
doi = {10.1016/J.DISC.2006.06.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZhangY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AifengJ07,
author = {Aifeng Yang and
Jinjiang Yuan},
title = {On the vertex arboricity of planar graphs of diameter two},
journal = {Discret. Math.},
volume = {307},
number = {19-20},
pages = {2438--2447},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2006.10.017},
doi = {10.1016/J.DISC.2006.10.017},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AifengJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/LuY07,
author = {Lingfa Lu and
Jinjiang Yuan},
title = {The single machine batching problem with identical family setup times
to minimize maximum lateness is strongly NP-hard},
journal = {Eur. J. Oper. Res.},
volume = {177},
number = {2},
pages = {1302--1309},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2005.12.027},
doi = {10.1016/J.EJOR.2005.12.027},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/LuY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YuanLNC07,
author = {Jinjiang Yuan and
Y. X. Lin and
C. T. Ng and
T. C. Edwin Cheng},
title = {Approximability of single machine scheduling with fixed jobs to minimize
total completion time},
journal = {Eur. J. Oper. Res.},
volume = {178},
number = {1},
pages = {46--56},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2006.01.025},
doi = {10.1016/J.EJOR.2006.01.025},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/YuanLNC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YuanCN07,
author = {Jinjiang Yuan and
T. C. Edwin Cheng and
C. T. Ng},
title = {NP-hardness of the single-variable-resource scheduling problem to
minimize the total weighted completion time},
journal = {Eur. J. Oper. Res.},
volume = {178},
number = {2},
pages = {631--633},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2006.02.014},
doi = {10.1016/J.EJOR.2006.02.014},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/YuanCN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YuanSCL07,
author = {Jinjiang Yuan and
Ameur Soukhal and
Youjun Chen and
Lingfa Lu},
title = {A note on the complexity of flow shop scheduling with transportation
constraints},
journal = {Eur. J. Oper. Res.},
volume = {178},
number = {3},
pages = {918--925},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2005.08.034},
doi = {10.1016/J.EJOR.2005.08.034},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/YuanSCL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YuanM07,
author = {Jinjiang Yuan and
Yundong Mu},
title = {Rescheduling with release dates to minimize makespan under a limit
on the maximum sequence disruption},
journal = {Eur. J. Oper. Res.},
volume = {182},
number = {2},
pages = {936--944},
year = {2007},
url = {https://doi.org/10.1016/j.ejor.2006.07.026},
doi = {10.1016/J.EJOR.2006.07.026},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/YuanM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LiYL07,
author = {Wenhua Li and
Jinjiang Yuan and
Yixun Lin},
title = {A note on special optimal batching structures to minimize total weighted
completion time},
journal = {J. Comb. Optim.},
volume = {14},
number = {4},
pages = {475--480},
year = {2007},
url = {https://doi.org/10.1007/s10878-007-9070-8},
doi = {10.1007/S10878-007-9070-8},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LiYL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/YuanZZ07,
author = {Jinjiang Yuan and
Jian Ying Zhang and
Sanming Zhou},
title = {Routing permutations and involutions on optical ring networks: complexity
results and solution to an open problem},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {609--621},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.07.004},
doi = {10.1016/J.JDA.2006.07.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/YuanZZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TianFY07,
author = {Ji Tian and
Ruyan Fu and
Jinjiang Yuan},
title = {On-line scheduling with delivery time on a single batch machine},
journal = {Theor. Comput. Sci.},
volume = {374},
number = {1-3},
pages = {49--57},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2006.12.001},
doi = {10.1016/J.TCS.2006.12.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TianFY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FuJYL07,
author = {Ruyan Fu and
Ji Tian and
Jinjiang Yuan and
Yixun Lin},
title = {Online scheduling in a parallel batch processing system to minimize
makespan using restarts},
journal = {Theor. Comput. Sci.},
volume = {374},
number = {1-3},
pages = {196--202},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2006.12.040},
doi = {10.1016/J.TCS.2006.12.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FuJYL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeLY07,
author = {Cheng He and
Yixun Lin and
Jinjiang Yuan},
title = {Bicriteria scheduling on a batching machine to minimize maximum lateness
and makespan},
journal = {Theor. Comput. Sci.},
volume = {381},
number = {1-3},
pages = {234--240},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.04.034},
doi = {10.1016/J.TCS.2007.04.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HeLY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/YangY06,
author = {Aifeng Yang and
Jinjiang Yuan},
title = {Partition the vertices of a graph into one independent set and one
acyclic set},
journal = {Discret. Math.},
volume = {306},
number = {12},
pages = {1207--1216},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.09.016},
doi = {10.1016/J.DISC.2005.09.016},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/YangY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ShangY06,
author = {Weiping Shang and
Jinjiang Yuan},
title = {Upper minus domination in a claw-free cubic graph},
journal = {Discret. Math.},
volume = {306},
number = {22},
pages = {2983--2988},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.09.050},
doi = {10.1016/J.DISC.2005.09.050},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ShangY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/NgCY06,
author = {C. T. Ng and
T. C. Edwin Cheng and
Jinjiang Yuan},
title = {A note on the complexity of the problem of two-agent scheduling on
a single machine},
journal = {J. Comb. Optim.},
volume = {12},
number = {4},
pages = {387--394},
year = {2006},
url = {https://doi.org/10.1007/s10878-006-9001-0},
doi = {10.1007/S10878-006-9001-0},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/NgCY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/YuanLNC06,
author = {Jinjiang Yuan and
Zhaohui Liu and
C. T. Ng and
T. C. Edwin Cheng},
title = {Single machine batch scheduling problem with family setup times and
release dates to minimize makespan},
journal = {J. Sched.},
volume = {9},
number = {6},
pages = {499--513},
year = {2006},
url = {https://doi.org/10.1007/s10951-006-8776-2},
doi = {10.1007/S10951-006-8776-2},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/YuanLNC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/LiQSY06,
author = {Wenhua Li and
Maurice Queyranne and
Maxim Sviridenko and
Jinjiang Yuan},
title = {Approximation algorithms for shop scheduling problems with minsum
objective: {A} correction},
journal = {J. Sched.},
volume = {9},
number = {6},
pages = {569--570},
year = {2006},
url = {https://doi.org/10.1007/s10951-006-8790-4},
doi = {10.1007/S10951-006-8790-4},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/LiQSY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChengNY06,
author = {T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {Multi-agent scheduling on a single machine to minimize total weighted
number of tardy jobs},
journal = {Theor. Comput. Sci.},
volume = {362},
number = {1-3},
pages = {273--281},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.07.011},
doi = {10.1016/J.TCS.2006.07.011},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChengNY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cans/ZhangGY06,
author = {Xiyong Zhang and
Hua Guo and
Jinjiang Yuan},
editor = {David Pointcheval and
Yi Mu and
Kefei Chen},
title = {A Note of Perfect Nonlinear Functions},
booktitle = {Cryptology and Network Security, 5th International Conference, {CANS}
2006, Suzhou, China, December 8-10, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4301},
pages = {259--269},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11935070\_18},
doi = {10.1007/11935070\_18},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/cans/ZhangGY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/ZhouY05,
author = {Ju Zhou and
Jinjiang Yuan},
title = {Characterization of induced matching extendable graphs with 2n vertices
and 3n-1 edges},
journal = {Australas. {J} Comb.},
volume = {33},
pages = {255--264},
year = {2005},
url = {http://ajc.maths.uq.edu.au/pdf/33/ajc\_v33\_p255.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/ZhouY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/ChengYY05,
author = {T. C. Edwin Cheng and
Jinjiang Yuan and
A. F. Yang},
title = {Scheduling a batch-processing machine subject to precedence constraints,
release dates and identical processing times},
journal = {Comput. Oper. Res.},
volume = {32},
pages = {849--859},
year = {2005},
url = {https://doi.org/10.1016/j.cor.2003.09.001},
doi = {10.1016/J.COR.2003.09.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/ChengYY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/QinJ05,
author = {Qin Wang and
Jinjiang Yuan},
title = {4-regular claw-free IM-extendable graphs},
journal = {Discret. Math.},
volume = {294},
number = {3},
pages = {303--309},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2004.11.009},
doi = {10.1016/J.DISC.2004.11.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/QinJ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhangY05,
author = {Zhao Zhang and
Jinjiang Yuan},
title = {A proof of an inequality concerning \emph{k}-restricted edge connectivity},
journal = {Discret. Math.},
volume = {304},
number = {1-3},
pages = {128--134},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.04.020},
doi = {10.1016/J.DISC.2005.04.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZhangY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YuanL05a,
author = {Jinjiang Yuan and
Yixun Lin},
title = {Single machine preemptive scheduling with fixed jobs to minimize tardiness
related criteria},
journal = {Eur. J. Oper. Res.},
volume = {164},
number = {3},
pages = {851--855},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2003.10.043},
doi = {10.1016/J.EJOR.2003.10.043},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/YuanL05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ChengNYL05,
author = {T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan and
Zhaohui Liu},
title = {Single machine scheduling to minimize total weighted tardiness},
journal = {Eur. J. Oper. Res.},
volume = {165},
number = {2},
pages = {423--443},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2004.04.013},
doi = {10.1016/J.EJOR.2004.04.013},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/ChengNYL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/YuanSF05,
author = {Jinjiang Yuan and
Weiping Shang and
Qi Feng},
title = {A note on the scheduling with two families of jobs},
journal = {J. Sched.},
volume = {8},
number = {6},
pages = {537--542},
year = {2005},
url = {https://doi.org/10.1007/s10951-005-4997-z},
doi = {10.1007/S10951-005-4997-Z},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/YuanSF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/YuanYC04,
author = {Jinjiang Yuan and
A. F. Yang and
T. C. Edwin Cheng},
title = {A note on the single machine serial batching scheduling problem to
minimize maximum lateness with identical processing times},
journal = {Eur. J. Oper. Res.},
volume = {158},
number = {2},
pages = {525--528},
year = {2004},
url = {https://doi.org/10.1016/S0377-2217(03)00361-8},
doi = {10.1016/S0377-2217(03)00361-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/YuanYC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/join/YuanZ04,
author = {Jinjiang Yuan and
Sanming Zhou},
title = {Polynomial Time Solvability Of The Weighted Ring Arc-Loading Problem
With Integer Splitting},
journal = {J. Interconnect. Networks},
volume = {5},
number = {2},
pages = {193--200},
year = {2004},
url = {https://doi.org/10.1142/S0219265904001106},
doi = {10.1142/S0219265904001106},
timestamp = {Fri, 05 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/join/YuanZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YuanLNC04,
author = {Jinjiang Yuan and
Zhaohui Liu and
C. T. Ng and
T. C. Edwin Cheng},
title = {The unbounded single machine parallel batch scheduling problem with
family jobs and release dates to minimize makespan},
journal = {Theor. Comput. Sci.},
volume = {320},
number = {2-3},
pages = {199--212},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.01.038},
doi = {10.1016/J.TCS.2004.01.038},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YuanLNC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/YuanW03,
author = {Jinjiang Yuan and
Qin Wang},
title = {Partition the vertices of a graph into induced matchings},
journal = {Discret. Math.},
volume = {263},
number = {1-3},
pages = {323--329},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00791-4},
doi = {10.1016/S0012-365X(02)00791-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/YuanW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/LiuYC03,
author = {Zhaohui Liu and
Jinjiang Yuan and
T. C. Edwin Cheng},
title = {On scheduling an unbounded batch machine},
journal = {Oper. Res. Lett.},
volume = {31},
number = {1},
pages = {42--48},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00186-4},
doi = {10.1016/S0167-6377(02)00186-4},
timestamp = {Sun, 27 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/LiuYC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/NgCYL03,
author = {C. T. Ng and
T. C. Edwin Cheng and
Jinjiang Yuan and
Zhaohui Liu},
title = {On the single machine serial batching scheduling problem to minimize
total completion time with precedence constraints, release dates and
identical processing times},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {323--326},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(03)00007-5},
doi = {10.1016/S0167-6377(03)00007-5},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/NgCYL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/NgCY03,
author = {C. T. Ng and
T. C. Edwin Cheng and
Jinjiang Yuan},
title = {Concurrent Open Shop Scheduling to Minimize the Weighted Number of
Tardy Jobs},
journal = {J. Sched.},
volume = {6},
number = {4},
pages = {405--412},
year = {2003},
url = {https://doi.org/10.1023/A:1024284828374},
doi = {10.1023/A:1024284828374},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/NgCY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChengNY03,
author = {T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {The Single Machine Batching Problem with Family Setup Times to Minimize
Maximum Lateness is Strongly NP-Hard},
journal = {J. Sched.},
volume = {6},
number = {5},
pages = {483--490},
year = {2003},
url = {https://doi.org/10.1023/A:1024858623282},
doi = {10.1023/A:1024858623282},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/ChengNY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChengNY03a,
author = {T. C. Edwin Cheng and
C. T. Ng and
Jinjiang Yuan},
title = {A Stronger Complexity Result for the Single Machine Multi-Operation
Jobs Scheduling Problem to Minimize the Number of Tardy Jobs},
journal = {J. Sched.},
volume = {6},
number = {6},
pages = {551--555},
year = {2003},
url = {https://doi.org/10.1023/A:1026276627133},
doi = {10.1023/A:1026276627133},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/ChengNY03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NgCY02,
author = {C. T. Ng and
T. C. Edwin Cheng and
Jinjiang Yuan},
title = {Strong NP-hardness of the single machine multi-operation jobs total
completion time scheduling problem},
journal = {Inf. Process. Lett.},
volume = {82},
number = {4},
pages = {187--191},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00274-5},
doi = {10.1016/S0020-0190(01)00274-5},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/NgCY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/NgCY02,
author = {C. T. Ng and
T. C. Edwin Cheng and
Jinjiang Yuan},
title = {A note on the single machine serial batching scheduling problem to
minimize maximum lateness with precedence constraints},
journal = {Oper. Res. Lett.},
volume = {30},
number = {1},
pages = {66--68},
year = {2002},
url = {https://doi.org/10.1016/S0167-6377(01)00105-5},
doi = {10.1016/S0167-6377(01)00105-5},
timestamp = {Fri, 19 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/NgCY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/WangY01,
author = {Qin Wang and
Jinjiang Yuan},
title = {Maximal IM-unextendable graphs},
journal = {Discret. Math.},
volume = {240},
number = {1-3},
pages = {295--298},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(01)00205-9},
doi = {10.1016/S0012-365X(01)00205-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/WangY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KangY00,
author = {Liying Kang and
Jinjiang Yuan},
title = {Bondage number of planar graphs},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {191--198},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00405-7},
doi = {10.1016/S0012-365X(99)00405-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KangY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhouY98,
author = {Sanming Zhou and
Jinjiang Yuan},
title = {Harper-type lower bounds and the bandwidths of the compositions of
graphs},
journal = {Discret. Math.},
volume = {181},
number = {1-3},
pages = {255--266},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00040-X},
doi = {10.1016/S0012-365X(97)00040-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZhouY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Jinjiang98,
author = {Jinjiang Yuan},
title = {Induced matching extendable graphs},
journal = {J. Graph Theory},
volume = {28},
number = {4},
pages = {203--213},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0118(199808)28:4\&\#60;203::AID-JGT2\&\#62;3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199808)28:4\&\#60;203::AID-JGT2\&\#62;3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Jinjiang98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/Yuan96,
author = {Jinjiang Yuan},
title = {Path-width and tree-width of the join of graphs},
journal = {Ars Comb.},
volume = {43},
year = {1996},
timestamp = {Tue, 20 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/Yuan96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HuangY96,
author = {Qiongxiang Huang and
Jinjiang Yuan},
title = {The automorphism groups of circulant digraphs of degree 3},
journal = {Ars Comb.},
volume = {44},
year = {1996},
timestamp = {Tue, 20 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/HuangY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Yuan95,
author = {Jinjiang Yuan},
title = {A local reductive elimination for the fill-in of graphs},
journal = {Discret. Math.},
volume = {147},
number = {1-3},
pages = {321--327},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00251-D},
doi = {10.1016/0012-365X(94)00251-D},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Yuan95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-05-19 00:15 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:
