default search action
Liqi Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Lili Zuo, Lingfa Lu, Liqi Zhang:
Single Machine Scheduling with Rejection and a Non-Availability Interval to Minimize the Maximum Delivery Completion Time Plus the Total Rejection Cost. Asia Pac. J. Oper. Res. 40(5): 2340017:1-2340017:11 (2023) - [j21]Lingfa Lu
, Liqi Zhang:
Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost. J. Comb. Optim. 46(1): 9 (2023) - [j20]Jianping Luo
Combined Improved CEEMDAN and Wavelet Transform Sea Wave Interference Suppression. Remote. Sens. 15(8): 2007 (2023) - [c7]Mengting Hu, Yinhao Bai, Yike Wu, Zhen Zhang
Uncertainty-Aware Unlikelihood Learning Improves Generative Aspect Sentiment Quad Prediction. ACL (Findings) 2023: 13481-13494 - [c6]Ligang Hou, Xin Shen, Liqi Zhang:
A Fuzzy Time Series Forecasting Model for Urban Mid- and Long-term Electricity Load Forecasting. ICNSC 2023: 1-6 - [c5]Ligang Hou, Xin Shen, Liqi Zhang:
Urban Electricity Demand Forecasting with a Hybrid Machine Learning Model. ICNSC 2023: 1-6 - [c4]Liqi Zhang
R-TES: Regularized Template Style for Generative Joint Relational Triple Extraction. MLNLP 2023: 21-26 - [i1]Mengting Hu, Yinhao Bai, Yike Wu, Zhen Zhang, Liqi Zhang, Hang Gao, Shiwan Zhao, Minlie Huang:
Uncertainty-Aware Unlikelihood Learning Improves Generative Aspect Sentiment Quad Prediction. CoRR abs/2306.00418 (2023) - 2022
- [j19]Zhiyuan Ouyang
High-Dimensional Seismic Data Reconstruction Based on Linear Radon Transform-Constrained Tensor CANDECOM/PARAFAC Decomposition. Remote. Sens. 14(24): 6275 (2022) - [j18]Liqi Zhang, Yanlei Li:
An Image Registration Method Based on Correlation Matching of Dominant Scatters for Distributed Array ISAR. Sensors 22(4): 1681 (2022) - [c3]Liqi Zhang, Lingfa Lu
Single Machine Scheduling with Rejection to Minimize the k-th Power of the Makespan. COCOON 2022: 220-231 - 2021
- [j17]Lingfa Lu
In-house production and outsourcing under different discount schemes on the total outsourcing cost. Ann. Oper. Res. 298(1): 361-374 (2021) - [c2]Lingfa Lu
Single Machine Scheduling with Rejection to Minimize the Weighted Makespan. AAIM 2021: 96-110 - [c1]Xue Yu, Lingfa Lu
Single Machine Scheduling with Rejection and Generalized Parameters. COCOA 2021: 234-246 - 2020
- [j16]Lingfa Lu
Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates. Asia Pac. J. Oper. Res. 37(1): 1950033:1-1950033:15 (2020)
2010 – 2019
- 2019
- [j15]Lingfa Lu
A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan. RAIRO Oper. Res. 53(4): 1261-1266 (2019) - 2018
- [j14]Xing Chai, Lingfa Lu
Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time. Asia Pac. J. Oper. Res. 35(6): 1850048:1-1850048:11 (2018) - 2017
- [j13]Lingfa Lu
Online Single Machine Scheduling to Minimize the Maximum Starting Time. Asia Pac. J. Oper. Res. 34(5): 1750022:1-1750022:9 (2017) - [j12]Lingfa Lu
Single-machine scheduling with production and rejection costs to minimize the maximum earliness. J. Comb. Optim. 34(2): 331-342 (2017) - 2016
- [j11]Liqi Zhang, Lingfa Lu
Parallel-machine scheduling with release dates and rejection. 4OR 14(2): 165-172 (2016) - [j10]Liqi Zhang, Lingfa Lu
New results on two-machine flow-shop scheduling with rejection. J. Comb. Optim. 31(4): 1493-1504 (2016) - [j9]Liqi Zhang, Lingfa Lu
Scheduling problems with rejection to minimize the maximum flow time. J. Syst. Sci. Complex. 29(5): 1293-1301 (2016) - [j8]Liqi Zhang, Lingfa Lu
Two-machine open-shop scheduling with rejection to minimize the makespan. OR Spectr. 38(2): 519-529 (2016) - 2015
- [j7]Lingfa Lu
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan. Theor. Comput. Sci. 572: 50-57 (2015) - 2011
- [j6]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) - 2010
- [j5]Liqi Zhang
Single-machine scheduling under the job rejection constraint. Theor. Comput. Sci. 411(16-18): 1877-1882 (2010)
2000 – 2009
- 2009
- [j4]Lingfa Lu
Bounded single-machine parallel-batch scheduling with release dates and rejection. Comput. Oper. Res. 36(10): 2748-2751 (2009) - [j3]Liqi Zhang
Single machine scheduling with release dates and rejection. Eur. J. Oper. Res. 198(3): 975-978 (2009) - 2008
- [j2]Lingfa Lu
Single machine scheduling with release dates and job delivery to minimize the makespan. Theor. Comput. Sci. 393(1-3): 102-108 (2008) - [j1]Lingfa Lu
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theor. Comput. Sci. 396(1-3): 283-289 (2008)
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-08-01 21:12 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: