default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNing Zhao 0003
Person information
- affiliation: Kunming University of Science and Technology, Faculty of Science, Yunnan, China
- affiliation (PhD): University of Macau, Business Information Systems, China
Other persons with the same name
- Ning Zhao (aka: Zhao Ning) — disambiguation page
- Ning Zhao 0001
![[0000-0002-0600-8930]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0600-8930")
— University of Birmingham, UK - Ning Zhao 0002 — Bohai University, College of Control Science and Engineering, Jinzhou, China (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Mengge Yuan, Kan Wu, Ning Zhao:
Human-machine cooperation: Optimizing layout design and drug retrieval sequencing in automated drug dispensing systems. Comput. Ind. Eng. 196: 110436 (2024)- 2023
- [j6]Mengge Yuan, Ning Zhao, Kan Wu, Zhibin Chen:
The storage location assignment problem of automated drug dispensing machines. Comput. Ind. Eng. 184: 109578 (2023) - [i3]Lulu Cheng, Ning Zhao, Kan Wu, Zhibin Chen:
The Multi-trip Autonomous Mobile Robots Scheduling Problem with Time Windows in a Stochastic Environment at Smart Hospitals. CoRR abs/2307.16215 (2023) - [i2]Lulu Cheng, Ning Zhao, Mengge Yuan, Kan Wu:
A Quick Response Algorithm for Dynamic Autonomous Mobile Robot Routing Problem with Time Windows. CoRR abs/2311.15302 (2023) - [i1]Mengge Yuan, Kan Wu, Ning Zhao:
Physical design optimization for automated drug dispensing systems in a human-machine interaction environment. CoRR abs/2312.11306 (2023)
2010 – 2019
- 2018
- [j5]Kan Wu, Ning Zhao, Yichi Shen:
Analysis and approximation for the performance of a workstation with various types of setups. Int. J. Prod. Res. 56(7): 2596-2610 (2018) - 2016
- [j4]Kan Wu, Yaoming Zhou, Ning Zhao:
Variability and the fundamental properties of production lines. Comput. Ind. Eng. 99: 364-371 (2016) - [j3]Kan Wu, Ning Zhao, Carman K. M. Lee:
Queue Time Approximations for a Cluster Tool With Job Cascading. IEEE Trans Autom. Sci. Eng. 13(2): 1200-1206 (2016) - [c4]Kan Wu, Ning Zhao:
Dependence among Single queues in series. ICIT 2016: 1347-1352 - [c3]Kan Wu, Ning Zhao:
Mean queue time approximation for a workstation with cascading. WSC 2016: 2664-2675 - 2015
- [j2]Ning Zhao, Zhaotong Lian, Kan Wu:
Analysis of a MAP/PH/1 Queue with Discretionary Priority Based on Service Stages. Asia Pac. J. Oper. Res. 32(6): 1550042:1-1550042:22 (2015) - [j1]Kan Wu, Ning Zhao:
Dependence among single stations in series and its applications in productivity improvement. Eur. J. Oper. Res. 247(1): 245-258 (2015) - [c2]Kan Wu, Ning Zhao:
Dependence among tandem queues and the second moment result on the theory of constraints. WSC 2015: 2860-2871 - 2014
- [c1]Kan Wu, Zhang Wu, Ning Zhao, Yijun Xu:
Approximating the performance of a station subject to changeover setups. WSC 2014: 2396-2403
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-12-10 21:46 CET 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:
