default search action
Cuixia Miao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Jiaming Hu, Dachuan Xu, Donglei Du, Cuixia Miao
:
Differentially private submodular maximization with a cardinality constraint over the integer lattice. J. Comb. Optim. 47(4): 58 (2024) - [j12]Fanyu Kong, Cuixia Miao, Yujia Huo, Jiaxin Song:
Single-machine scheduling with coupled task and rejection. Math. Found. Comput. 7(3): 328-335 (2024) - [j11]Juan Zou, Yuhan Zhao, Cuixia Miao, Longchun Wang
A set-theoretic approach to algebraic L-domains. Math. Struct. Comput. Sci. 34(3): 244-257 (2024) - 2023
- [j10]Cuixia Miao, Fanyu Kong, Juan Zou, Ran Ma, Yujia Huo:
Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time. Asia Pac. J. Oper. Res. 40(1): 2240011:1-2240011:13 (2023) - [j9]Cuixia Miao, Jiaxin Song, Yuzhong Zhang:
Single-Machine Time-Dependent Scheduling with Proportional and Delivery Times. Asia Pac. J. Oper. Res. 40(4): 2240015:1-2240015:12 (2023) - [j8]Yujia Huo, Cuixia Miao
Multitasking scheduling with alternate periods. J. Comb. Optim. 45(3): 92 (2023) - 2022
- [c3]Juan Zou, Yuhan Zhao, Cuixia Miao, Longchun Wang:
A Set-Theoretic Representation of Algebraic L-domains. TAMC 2022: 370-381 - 2021
- [j7]Ran Ma, Sainan Guo, Cuixia Miao:
A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection. Appl. Math. Comput. 392: 125670 (2021) - [j6]Ran Ma, Wenwen Han, Cuixia Miao, Juan Zou:
An Optimal Online Algorithm for Scheduling with Learning Consideration. Asia Pac. J. Oper. Res. 38(5): 2140002:1-2140002:17 (2021) - [c2]Jiaming Hu, Dachuan Xu
Differentially Private Submodular Maximization over Integer Lattice. CSoNet 2021: 59-67
2010 – 2019
- 2019
- [j5]Cuixia Miao
Parallel-Batch Scheduling With Deterioration and Group Technology. IEEE Access 7: 119082-119086 (2019) - 2016
- [j4]Juan Zou, Cuixia Miao:
The single machine serial batch scheduling problems with rejection. Oper. Res. 16(2): 211-221 (2016) - 2012
- [j3]Cuixia Miao, Yuzhong Zhang, Cuilian Wu:
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness. Theor. Comput. Sci. 462: 80-87 (2012) - 2011
- [j2]Cuixia Miao, Yuzhong Zhang, Zhigang Cao:
Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs. Inf. Process. Lett. 111(16): 798-803 (2011) - 2010
- [c1]Cuixia Miao, Yuzhong Zhang, Chengfei Wang:
Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines. AAIM 2010: 220-228
2000 – 2009
- 2006
- [j1]Cuixia Miao, Yuzhong Zhang:
On-Line Scheduling with Rejection on Identical Parallel Machines. J. Syst. Sci. Complex. 19(3): 431-435 (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-07-15 00:14 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: