default search action
Nengmin Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j50]Meng Zhang
, Wei Cui, Qi Jiang, Nengmin Wang
Routing Optimization for Healthcare Waste Collection With Temporary Storing Risks and Sequential Uncertain Service Requests. IEEE Access 12: 2868-2881 (2024) - [j49]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) - [j48]Shuyi Sun
Guaranteed-selling service of online used-car reselling platform: Feasibility and applicability compared with conventional resell and agency resell. Expert Syst. Appl. 255: 124717 (2024) - [j47]Yi Chen
Do E-Tailers Benefit From Cooperative- Return-to-Store? IEEE Trans. Engineering Management 71: 3220-3232 (2024) - [j46]Rong Dong
Whether to Implement Privacy Protection in Trade-Ins Under Competition. IEEE Trans. Engineering Management 71: 10751-10766 (2024) - [j45]Xiaocui Li, Nengmin Wang
Environmental Regulations-Enabled External Knowledge Acquisition and Proactive Environmental Strategy: The Moderating Effect of Social Media Capability. IEEE Trans. Engineering Management 71: 14590-14607 (2024) - 2023
- [j44]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) - [j43]Xiao Cui, Zhengwen He
A hybrid metaheuristic algorithm for resource-constrained proactive project scheduling with uncertainty-handling effort. Comput. Ind. Eng. 186: 109741 (2023) - [j42]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) - [j41]Yong Ma
Tabu search for proactive project scheduling problem with flexible resources. Comput. Oper. Res. 153: 106185 (2023) - [j40]Xiaohui Lyu, Haoxun Chen
A benders decomposition algorithm for a bid generation problem in the procurement of Three-echelon transportation services. Comput. Oper. Res. 158: 106291 (2023) - [j39]Xinyue Liang, Nengmin Wang
Bi-objective multi-period vehicle routing for perishable goods delivery considering customer satisfaction. Expert Syst. Appl. 220: 119712 (2023) - [j38]Nengmin Wang, Wei Cui, Meng Zhang
Routing optimization for medical waste collection considering infectious risk and multiple disposal centers. Expert Syst. Appl. 234: 121035 (2023) - [j37]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) - [j36]Tao Li, Nengmin Wang
A Bi-Objective Lane Reservation Problem Considering Dynamic Traffic Flow. IEEE Trans. Intell. Transp. Syst. 24(1): 367-381 (2023) - [j35]Weixuan Shi
A Bi-Objective Pollution Routing Optimisation Problem With Decentralised Cooperation and Split Delivery. IEEE Trans. Intell. Transp. Syst. 24(11): 12357-12371 (2023) - 2022
- [j34]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) - [j33]Qidong He
Competitive collection with convenience-perceived customers. Eur. J. Oper. Res. 303(1): 239-254 (2022) - [j32]Chenhui Liu
Ensuring employees' information security policy compliance by carrot and stick: the moderating roles of organizational commitment and gender. Inf. Technol. People 35(2): 802-834 (2022) - [j31]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) - [j30]Dandan Gao, Nengmin Wang
Value of Information Sharing in Online Retail Supply Chain Considering Product Loss. IEEE Trans. Engineering Management 69(5): 2155-2172 (2022) - 2021
- [j29]Fei Bu, Nengmin Wang, Bin Jiang, Qi Jiang:
Motivating information system engineers' acceptance of Privacy by Design in China: An extended UTAUT model. Int. J. Inf. Manag. 60: 102358 (2021) - [j28]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
- [j27]Qinge Guo
Bi-Objective Vehicle Routing for Muck Transportation in Urban Road Networks. IEEE Access 8: 114219-114227 (2020) - [j26]Jie Gao
Quality incentive contracts considering asymmetric product manufacturability information: Piece rate vs. Tournament. Comput. Ind. Eng. 144: 106446 (2020) - [j25]Nengmin Wang
Competitive dual-collecting regarding consumer behavior and coordination in closed-loop supply chain. Comput. Ind. Eng. 144: 106481 (2020) - [j24]Fei Bu, Nengmin Wang, Bin Jiang, Huigang Liang
"Privacy by Design" implementation: Information system engineers' perspective. Int. J. Inf. Manag. 53: 102124 (2020) - [j23]Chenhui Liu
Motivating information security policy compliance: The critical role of supervisor-subordinate guanxi and organizational commitment. Int. J. Inf. Manag. 54: 102152 (2020) - [j22]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
- [j21]Qunli Yuchi, Nengmin Wang, Shuang Li, Zhen Yang, Bin Jiang:
A Bi-Objective Reverse Logistics Network Design Under the Emission Trading Scheme. IEEE Access 7: 105072-105085 (2019) - [j20]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) - [j19]Qidong He
Competitive collection under channel inconvenience in closed-loop supply chain. Eur. J. Oper. Res. 275(1): 155-166 (2019) - [j18]Zhen Yang
An effective hybrid approach to the two-stage capacitated facility location problem. Eur. J. Oper. Res. 275(2): 467-480 (2019) - [j17]Gengzhong Feng, Jiawen Zhu, Nengmin Wang, Huigang Liang:
How Paternalistic Leadership Influences IT Security Policy Compliance: The Mediating Role of the Social Bond. J. Assoc. Inf. Syst. 20(11): 2 (2019) - [j16]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) - [j15]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) - [c3]Xiaohui Lyu, Haoxun Chen, Nengmin Wang:
An Iterative Request Exchange Mechanism for Carrier Collaboration in Less than Truckload Transportation. ICORES 2019: 299-306 - 2018
- [j14]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) - [j13]Qi Liu, Gengzhong Feng, Nengmin Wang, Giri Kumar Tayi
A multi-objective model for discovering high-quality knowledge based on data quality and prior knowledge. Inf. Syst. Frontiers 20(2): 401-416 (2018) - [j12]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) - [j11]Nengmin Wang
Bi-Objective Vehicle Routing for Hazardous Materials Transportation With No Vehicles Travelling in Echelon. IEEE Trans. Intell. Transp. Syst. 19(6): 1867-1879 (2018) - 2017
- [j10]Yong Wu
Decisions making in information security outsourcing: Impact of complementary and substitutable firms. Comput. Ind. Eng. 110: 1-12 (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]Tao Jia
Optimal production-delivery policy for a vendor-buyers integrated system considering postponed simultaneous delivery. Comput. Ind. Eng. 99: 1-15 (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) - [j4]Yong Wu
Game of information security investment: Impact of attack types and network vulnerability. Expert Syst. Appl. 42(15-16): 6132-6146 (2015) - [j3]Huigang Liang
Employees' Exploration of Complex Systems: An Integrative View. J. Manag. Inf. Syst. 32(1): 322-357 (2015) - 2014
- [j2]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)
2000 – 2009
- 2009
- [j1]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) - [c2]Tong Yang, Nengmin Wang:
Urban Innovation Based on the Environmental Management. ESIAT (1) 2009: 132-136 - [c1]Tong Yang, Nengmin Wang:
The Model and Strategy of Knowledge Transfer in Project Environments. SSME 2009: 120-123
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-10-04 21:03 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: