Liqi Zhang

Orcid: 0009-0000-8010-9011

According to our database1, Liqi Zhang authored at least 29 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
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., October, 2023

Scheduling problems with rejection to minimize the k-th power of the makespan plus the total rejection cost.
J. Comb. Optim., August, 2023

Combined Improved CEEMDAN and Wavelet Transform Sea Wave Interference Suppression.
Remote. Sens., April, 2023

R-TES: Regularized Template Style for Generative Joint Relational Triple Extraction.
Proceedings of the 6th International Conference on Machine Learning and Natural Language Processing, 2023

Urban Electricity Demand Forecasting with a Hybrid Machine Learning Model.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2023

A Fuzzy Time Series Forecasting Model for Urban Mid- and Long-term Electricity Load Forecasting.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2023

Uncertainty-Aware Unlikelihood Learning Improves Generative Aspect Sentiment Quad Prediction.
Proceedings of the Findings of the Association for Computational Linguistics: ACL 2023, 2023

2022
High-Dimensional Seismic Data Reconstruction Based on Linear Radon Transform-Constrained Tensor CANDECOM/PARAFAC Decomposition.
Remote. Sens., December, 2022

An Image Registration Method Based on Correlation Matching of Dominant Scatters for Distributed Array ISAR.
Sensors, 2022

Single Machine Scheduling with Rejection to Minimize the k-th Power of the Makespan.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021
In-house production and outsourcing under different discount schemes on the total outsourcing cost.
Ann. Oper. Res., 2021

Single Machine Scheduling with Rejection and Generalized Parameters.
Proceedings of the Combinatorial Optimization and Applications, 2021

Single Machine Scheduling with Rejection to Minimize the Weighted Makespan.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates.
Asia Pac. J. Oper. Res., 2020

2019
A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan.
RAIRO Oper. Res., 2019

2018
Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time.
Asia Pac. J. Oper. Res., 2018

2017
Single-machine scheduling with production and rejection costs to minimize the maximum earliness.
J. Comb. Optim., 2017

Online Single Machine Scheduling to Minimize the Maximum Starting Time.
Asia Pac. J. Oper. Res., 2017

2016
Two-machine open-shop scheduling with rejection to minimize the makespan.
OR Spectr., 2016

Scheduling problems with rejection to minimize the maximum flow time.
J. Syst. Sci. Complex., 2016

New results on two-machine flow-shop scheduling with rejection.
J. Comb. Optim., 2016

Parallel-machine scheduling with release dates and rejection.
4OR, 2016

2015
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan.
Theor. Comput. Sci., 2015

2011
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints.
Theor. Comput. Sci., 2011

2010
Single-machine scheduling under the job rejection constraint.
Theor. Comput. Sci., 2010

2009
Single machine scheduling with release dates and rejection.
Eur. J. Oper. Res., 2009

Bounded single-machine parallel-batch scheduling with release dates and rejection.
Comput. Oper. Res., 2009

2008
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan.
Theor. Comput. Sci., 2008

Single machine scheduling with release dates and job delivery to minimize the makespan.
Theor. Comput. Sci., 2008


  Loading...