default search action
Zhengwen He
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Houkun Zhang, Ran Ma, Zhengwen He:
Project scheduling cost optimization based on resource transfer costs and robustness. Comput. Oper. Res. 161: 106445 (2024) - [j28]Xue Li, Zhengwen He, Nengmin Wang:
A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective. Comput. Oper. Res. 166: 106623 (2024) - 2023
- [j27]Junling Han, Nengmin Wang, Zhengwen He, Bin Jiang:
Product pricing and recycling mode considering competition under used product error classification. Comput. Ind. Eng. 186: 109735 (2023) - [j26]Xiao Cui, Zhengwen He
, Nengmin Wang, Weibo Zheng:
A hybrid metaheuristic algorithm for resource-constrained proactive project scheduling with uncertainty-handling effort. Comput. Ind. Eng. 186: 109741 (2023) - [j25]Shuang Zheng, Zhengwen He, Zhen Yang, Chengbin Chu, Nengmin Wang:
Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem. Comput. Oper. Res. 153: 106183 (2023) - [j24]Yong Ma
Tabu search for proactive project scheduling problem with flexible resources. Comput. Oper. Res. 153: 106185 (2023) - [j23]Dandan Gao, Nengmin Wang, Zhengwen He, Li Zhou
Analysis of bullwhip effect and inventory cost in the online closed-loop supply chain. Int. J. Prod. Res. 61(20): 6808-6828 (2023) - 2022
- [j22]Zhiqiang Ma, Weibo Zheng, Zhengwen He, Nengmin Wang, Xuejun Hu:
A genetic algorithm for proactive project scheduling with resource transfer times. Comput. Ind. Eng. 174: 108754 (2022) - [j21]Xue Li, Zhengwen He, Nengmin Wang, Mario Vanhoucke
Multimode time-cost-robustness trade-off project scheduling problem under uncertainty. J. Comb. Optim. 43(5): 1173-1202 (2022) - 2021
- [j20]Qunli Yuchi, Nengmin Wang, Zhengwen He, Haoxun Chen:
Hybrid heuristic for the location-inventory-routing problem in closed-loop supply chain. Int. Trans. Oper. Res. 28(3): 1265-1295 (2021) - 2020
- [j19]Shuang Zheng, Zhen Yang, Zhengwen He, Nengmin Wang, Chengbin Chu, Haiyang Yu:
Hybrid simulated annealing and reduced variable neighbourhood search for an aircraft scheduling and parking problem. Int. J. Prod. Res. 58(9): 2626-2646 (2020)
2010 – 2019
- 2019
- [j18]Yukang He, Jingwen Zhang, Zhengwen He:
Metaheuristic Algorithms for Multimode Multiproject Scheduling With the Objective of Positive Cash Flow Balance. IEEE Access 7: 157427-157436 (2019) - [j17]Zhiqiang Ma, Erik Demeulemeester, Zhengwen He
A computational experiment to explore better robustness measures for project scheduling under two types of uncertain environments. Comput. Ind. Eng. 131: 382-390 (2019) - [j16]Qidong He
Competitive collection under channel inconvenience in closed-loop supply chain. Eur. J. Oper. Res. 275(1): 155-166 (2019) - [j15]Jie Yan, Renjing Liu, Zhengwen He, Xiaobo Wan:
How to Manage Individual Forgetting: Analysis and Comparison of Different Knowledge Management Strategies. J. Artif. Soc. Soc. Simul. 22(4) (2019) - [j14]Meng Zhang
Bi-Objective Vehicle Routing for Hazardous Materials Transportation With Actual Load Dependent Risks and Considering the Risk of Each Vehicle. IEEE Trans. Engineering Management 66(3): 429-442 (2019) - [j13]Zhiqiang Ma
A Genetic Algorithm for the Proactive Resource-Constrained Project Scheduling Problem With Activity Splitting. IEEE Trans. Engineering Management 66(3): 459-474 (2019) - 2018
- [j12]Minjing Ning
Metaheuristic Algorithms for Proactive and Reactive Project Scheduling to Minimize Contractor's Cash Flow Gap under Random Activity Duration. IEEE Access 6: 30547-30558 (2018) - [j11]Weibo Zheng, Zhengwen He, Nengmin Wang, Tao Jia:
Proactive and reactive resource-constrained max-NPV project scheduling with random activity duration. J. Oper. Res. Soc. 69(1): 115-126 (2018) - 2017
- [j10]Yanting Wang, Zhengwen He, Louis-Philippe Kerkhove, Mario Vanhoucke
On the performance of priority rules for the stochastic resource constrained multi-project scheduling problem. Comput. Ind. Eng. 114: 223-234 (2017) - [j9]Zhengwen He, Hua He, Renjing Liu, Nengmin Wang:
Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap. Comput. Oper. Res. 78: 564-577 (2017) - [j8]Dandan Gao, Nengmin Wang, Zhengwen He, Tao Jia:
The Bullwhip Effect in an Online Retail Supply Chain: A Perspective of Price-Sensitive Demand Based on the Price Discount in E-Commerce. IEEE Trans. Engineering Management 64(2): 134-148 (2017) - 2016
- [j7]Bo Xu, Renjing Liu, Zhengwen He:
Individual irrationality, network structure, and collective intelligence: An agent-based simulation approach. Complex. 21(S1): 44-54 (2016) - [j6]Shuang Li, Nengmin Wang, Tao Jia, Zhengwen He, Huigang Liang
Multiobjective Optimization for Multiperiod Reverse Logistics Network Design. IEEE Trans. Engineering Management 63(2): 223-236 (2016) - 2015
- [j5]Yungao Ma, Nengmin Wang, Zhengwen He, Jizhou Lu
Analysis of the bullwhip effect in two parallel supply chains with interacting price-sensitive demands. Eur. J. Oper. Res. 243(3): 815-825 (2015) - 2014
- [j4]Zhengwen He, Nengmin Wang, Pengxiang Li:
Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective. Ann. Oper. Res. 213(1): 203-220 (2014) - 2012
- [j3]Zhengwen He, Renjing Liu, Tao Jia:
Metaheuristics for multi-mode capital-constrained project payment scheduling. Eur. J. Oper. Res. 223(3): 605-613 (2012)
2000 – 2009
- 2009
- [j2]Zhengwen He, Nengmin Wang, Tao Jia, Yu Xu:
Simulated annealing and tabu search for multi-mode project payment scheduling. Eur. J. Oper. Res. 198(3): 688-696 (2009) - 2008
- [j1]Zhengwen He, Yu Xu:
Multi-mode project payment scheduling problems with bonus-penalty structure. Eur. J. Oper. Res. 189(3): 1191-1207 (2008) - [c1]Renjing Liu, Zhengwen He, Yingluo Wang:
Perfect Bayesian Equilibrium Analysis on the Investment Game of R&D Activities of Asymmetry Firms. FSKD (4) 2008: 595-601
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-27 16:45 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: