default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShisheng Li
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Ren-Xia Chen, Shi-Sheng Li, Qi Feng:
Minimizing Total Weighted Late Work in a Proportionate Flow Shop with Job Rejection. Asia Pac. J. Oper. Res. 41(3): 2350023:1-2350023:23 (2024)- [j35]Ren-Xia Chen
, Shi-Sheng Li:
Two-machine job shop scheduling with optional job rejection. Optim. Lett. 18(7): 1593-1618 (2024) - 2023
- [j34]Shi-Sheng Li, Ren-Xia Chen:
Competitive two-agent scheduling with release dates and preemption on a single machine. J. Sched. 26(3): 227-249 (2023) - [j33]Shisheng Li, Qiong Yuan:
Optimization of automotive suspension system using vibration and noise control for intelligent transportation system. Soft Comput. 27(12): 8315-8329 (2023) - 2022
- [j32]Shi-Sheng Li, Ren-Xia Chen:
Minimizing total weighted late work on a single-machine with non-availability intervals. J. Comb. Optim. 44(2): 1330-1355 (2022) - 2021
- [j31]Ren-Xia Chen, Shi-Sheng Li:
Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs. Asia Pac. J. Oper. Res. 38(2): 2050046:1-2050046:19 (2021) - [j30]Cheng He, Shi-Sheng Li, Jing Wu:
Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine. RAIRO Oper. Res. 55(6): 3701-3714 (2021) - 2020
- [j29]Ren-Xia Chen, Shi-Sheng Li:
Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40(4): 1044-1064 (2020) - [j28]Shi-Sheng Li, Ren-Xia Chen:
Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties. Optim. Lett. 14(7): 1681-1699 (2020) - [j27]Shi-Sheng Li, Jinjiang Yuan:
Single-machine scheduling with multi-agents to minimize total weighted late work. J. Sched. 23(4): 497-512 (2020)
2010 – 2019
- 2019
- [j26]Ren-Xia Chen, Shi-Sheng Li:
Two-agent single-machine scheduling with cumulative deterioration. 4OR 17(2): 201-219 (2019) - [j25]Shi-Sheng Li, Ren-Xia Chen, Qi Feng, Chengwen Jiao:
Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. J. Comb. Optim. 38(3): 957-971 (2019) - 2018
- [j24]Wenjie Li, Hailing Liu, Shisheng Li:
Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time. Asia Pac. J. Oper. Res. 35(4): 1850024:1-1850024:12 (2018) - [j23]Wenjie Li, Shisheng Li, Qi Feng:
Online batch scheduling with kind release times and incompatible families to minimize makespan. Optim. Lett. 12(2): 301-310 (2018) - 2017
- [j22]Shi-Sheng Li, Ren-Xia Chen:
Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine. Asia Pac. J. Oper. Res. 34(2): 1750010:1-1750010:17 (2017) - [j21]Shi-Sheng Li, De-Liang Qian, Ren-Xia Chen:
Proportionate Flow Shop Scheduling with Rejection. Asia Pac. J. Oper. Res. 34(4): 1750015:1-1750015:13 (2017) - [j20]Ruyan Fu, Ji Tian, Shisheng Li, Jinjiang Yuan:
An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities. J. Comb. Optim. 34(4): 1187-1197 (2017) - 2016
- [j19]Liqi Zhang, Lingfa Lu, Shisheng Li:
New results on two-machine flow-shop scheduling with rejection. J. Comb. Optim. 31(4): 1493-1504 (2016) - [j18]Shi-Sheng Li, Ren-Xia Chen, Qi Feng:
Scheduling two job families on a single machine with two competitive agents. J. Comb. Optim. 32(3): 784-799 (2016) - 2015
- [j17]Wenjie Li, Shisheng Li:
Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs. Int. J. Syst. Sci. 46(4): 652-661 (2015) - [j16]Shisheng Li, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Single-machine batch scheduling with job processing time compatibility. Theor. Comput. Sci. 583: 57-66 (2015) - 2014
- [j15]Shi-Sheng Li, Ren-Xia Chen:
Group Scheduling with Two Competing Agents on a Single Machine. Asia Pac. J. Oper. Res. 31(6) (2014) - [j14]Shi-Sheng Li, Ren-Xia Chen:
Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs. Comput. Ind. Eng. 73: 5-10 (2014) - 2012
- [j13]Shisheng Li, Baoqiang Fan:
Single-Machine Scheduling with Proportionally deteriorating Jobs subject to Availability Constraints. Asia Pac. J. Oper. Res. 29(4) (2012) - [j12]Shisheng Li, Jinjiang Yuan:
Unbounded parallel-batching scheduling with two competitive agents. J. Sched. 15(5): 629-640 (2012) - 2011
- [j11]Shisheng Li:
Scheduling Proportionally deteriorating Jobs in Two-Machine Open shop with a Non-Bottleneck Machine. Asia Pac. J. Oper. Res. 28(5): 623-631 (2011) - [j10]Shisheng Li, C. T. Ng, T. C. Edwin Cheng, Jinjiang Yuan:
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan. Eur. J. Oper. Res. 210(3): 482-488 (2011) - [j9]Shisheng Li, Jinjiang Yuan, Baoqiang Fan:
Unbounded parallel-batch scheduling with family jobs and delivery coordination. Inf. Process. Lett. 111(12): 575-582 (2011) - [j8]Baoqiang Fan, Shisheng Li, Li Zhou, Liqi Zhang:
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints. Theor. Comput. Sci. 412(4-5): 275-280 (2011) - [c3]Shisheng Li, Buqi Cheng, Xiao-Feng Li:
TypeCastor: demystify dynamic typing of JavaScript applications. HiPEAC 2011: 55-65 - 2010
- [j7]Shisheng Li, Jinjiang Yuan:
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan. J. Comb. Optim. 19(1): 84-93 (2010) - [j6]Yong-fen Ran, Guang-chi Xiong, Shi-Sheng Li, Liao-yuan Ye:
Study on deformation prediction of landslide based on genetic algorithm and improved BP neural network. Kybernetes 39(8): 1245-1254 (2010) - [j5]C. T. Ng, Shisheng Li, T. C. Edwin Cheng, Jinjiang Yuan:
Preemptive scheduling with simple linear deterioration on a single machine. Theor. Comput. Sci. 411(40-42): 3578-3586 (2010) - [j4]Shisheng Li, Jinjiang Yuan:
Parallel-machine scheduling with deteriorating jobs and rejection. Theor. Comput. Sci. 411(40-42): 3642-3650 (2010) - [c2]Jiutao Nie, Buqi Cheng, Shisheng Li, Ligang Wang, Xiao-Feng Li:
Vectorization for Java. NPC 2010: 3-17
2000 – 2009
- 2009
- [j3]Jinjiang Yuan, Shisheng Li, Ji Tian, Ruyan Fu:
A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. J. Comb. Optim. 17(2): 206-213 (2009) - [j2]Shisheng Li, Jinjiang Yuan:
Scheduling with families of jobs and delivery coordination under job availability. Theor. Comput. Sci. 410(47-49): 4856-4863 (2009) - 2007
- [c1]Shisheng Li, Yinghua Zhou, Guangzhong Sun, Guoliang Chen:
Study on Parallel Machine Scheduling Problem with Buffer. IMSCCS 2007: 278-273 - 2006
- [j1]Shisheng Li, Guangzhong Sun, Guoliang Chen:
Improved algorithm for finding next-to-shortest paths. Inf. Process. Lett. 99(5): 192-194 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:41 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:
