Остановите войну!
for scientists:
default search action
Zhongshun Shi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j19]Zhongshun Shi, Yijie Peng, Leyuan Shi, Chun-Hung Chen, Michael C. Fu:
Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination. INFORMS J. Comput. 34(1): 557-568 (2022) - [c7]Hang Ma, Cheng Zhang, Zhongshun Shi:
A Simulation Optimization-Aided Learning Method for Design Automation of Scheduling Rules. CASE 2022: 1992-1997 - [i1]Yanwen Li, Siyang Gao, Zhongshun Shi:
Asymptotic Optimality of Myopic Ranking and Selection Procedures. CoRR abs/2211.14723 (2022) - 2021
- [j18]Tao Wu, Zhongshun Shi, Canrong Zhang:
The hub location problem with market selection. Comput. Oper. Res. 127: 105136 (2021) - [j17]Zhongshun Shi, Hang Ma, Meiheng Ren, Tao Wu, Andrew Junfang Yu:
A learning-based two-stage optimization method for customer order scheduling. Comput. Oper. Res. 136: 105488 (2021) - [j16]Ming Qin, Runsen Wang, Zhongshun Shi, Lingxuan Liu, Leyuan Shi:
A Genetic Programming-Based Scheduling Approach for Hybrid Flow Shop With a Batch Processor and Waiting Time Constraint. IEEE Trans Autom. Sci. Eng. 18(1): 94-105 (2021) - [j15]Ming Qin, Zhongshun Shi, Weiwei Chen, Siyang Gao, Leyuan Shi:
Wafer Defect Inspection Optimization With Partial Coverage - A Numerical Approach. IEEE Trans Autom. Sci. Eng. 18(4): 1916-1927 (2021) - 2020
- [j14]Tao Wu, Zhongshun Shi, Zhe Liang, Xiaoning Zhang, Canrong Zhang:
Dantzig-Wolfe decomposition for the facility location and production planning problem. Comput. Oper. Res. 124: 105068 (2020) - [j13]Hang Ma, Hyo-Kyung Lee, Zhongshun Shi, Jingshan Li:
Workforce Allocation in Motorcycle Transmission Assembly Lines: A Case Study on Modeling, Analysis, and Improvement. IEEE Robotics Autom. Lett. 5(3): 4164-4171 (2020)
2010 – 2019
- 2019
- [j12]Fei Gao, Zhongshun Shi, Siyang Gao, Hui Xiao:
Efficient simulation budget allocation for subset selection using regression metamodels. Autom. 106: 192-200 (2019) - [j11]Zewen Huang, Zhongshun Shi, Leyuan Shi:
Minimising total weighted completion time on batch and unary machines with incompatible job families. Int. J. Prod. Res. 57(2): 567-581 (2019) - [j10]Weihao Wang, Zhongshun Shi, Leyuan Shi, Qingbin Zhao:
Integrated optimisation on flow-shop production with cutting stock. Int. J. Prod. Res. 57(19): 5996-6012 (2019) - [j9]Yijie Peng, Edward Huang, Jie Xu, Zhongshun Shi, Chun-Hung Chen:
A Coordinate Optimization Approach for Concurrent Design. IEEE Trans. Autom. Control. 64(7): 2913-2920 (2019) - [j8]Fei Gao, Siyang Gao, Hui Xiao, Zhongshun Shi:
Advancing Constrained Ranking and Selection With Regression in Partitioned Domains. IEEE Trans Autom. Sci. Eng. 16(1): 382-391 (2019) - [c6]Zhongshun Shi, Siyang Gao, Jianzhong Du, Hang Ma, Leyuan Shi:
Automatic Design of Dispatching Rules for Real-time optimization of Complex Production Systems*. SII 2019: 55-60 - 2018
- [j7]Zhongshun Shi, Zewen Huang, Leyuan Shi:
Customer order scheduling on batch processing machines with incompatible job families. Int. J. Prod. Res. 56(1-2): 795-808 (2018) - 2017
- [j6]Pai Liu, Xi Zhang, Zhongshun Shi, Zewen Huang:
Simulation Optimization for MRO Systems Operations. Asia Pac. J. Oper. Res. 34(2): 1750003:1-1750003:23 (2017) - [j5]Yu Zhao, Xi Zhang, Zhongshun Shi, Lei He:
Grain Price Forecasting Using a Hybrid Stochastic Method. Asia Pac. J. Oper. Res. 34(5): 1750020:1-1750020:24 (2017) - [j4]Zewen Huang, Zhongshun Shi, Cheng Zhang, Leyuan Shi:
A Note on "Two new approaches for a two-stage hybrid flowshop problem with a single batch processing machine under waiting time constraint". Comput. Ind. Eng. 110: 590-593 (2017) - [j3]Cheng Zhang, Zhongshun Shi, Zewen Huang, Yifan Wu, Leyuan Shi:
Flow shop scheduling with a batch processor and limited buffer. Int. J. Prod. Res. 55(11): 3217-3233 (2017) - [j2]Zhongshun Shi, Longfei Wang, Pai Liu, Leyuan Shi:
Minimizing Completion Time for Order Scheduling: Formulation and Heuristic Algorithm. IEEE Trans Autom. Sci. Eng. 14(4): 1558-1569 (2017) - 2016
- [c5]Zhongshun Shi, Zewen Huang, Leyuan Shi:
Two-stage flow shop with a batch processor and limited buffer. CASE 2016: 395-400 - 2015
- [j1]Jie Song, Zhongshun Shi, Bofei Sun, Leyuan Shi:
Treatment Planning for Volumetric-Modulated Arc Therapy: Model and Heuristic Algorithms. IEEE Trans Autom. Sci. Eng. 12(1): 116-126 (2015) - [c4]Zhongshun Shi, Pai Liu, Hongqiang Gao, Leyuan Shi:
Production planning for a class of batch processing problem. CASE 2015: 1188-1193 - 2014
- [c3]Zhongshun Shi, Longfei Wang, Leyuan Shi:
Approximation method to rank-one binary matrix factorization. CASE 2014: 800-805 - 2013
- [c2]Longfei Wang, Zhongshun Shi, Leyuan Shi:
A novel quadratic formulation for customer order scheduling problem. CASE 2013: 576-580 - [c1]Bofei Sun, Zhongshun Shi, Jie Song, Guangying Zhu, Leyuan Shi:
A linearized model and nested-partitions heuristics for VMAT radiation treatment planning optimization. CASE 2013: 629-633
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-04-02 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint