default search action
Leilei Meng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j49]Wen-Qiang Zou
, Chao Xu, Yangli Jia
Sustainable optimization of balancing valve settings in urban heating systems with an enhanced Jaya algorithm. Expert Syst. Appl. 261: 125466 (2025) - 2024
- [j48]Yingying Cui
An Effective Discrete Jaya Algorithm for Multi-AGVs Scheduling Problem With Dynamic Unloading Time. IEEE Access 12: 101701-101716 (2024) - [j47]Biao Zhang, Leilei Meng, Chao Lu
Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem. Comput. Oper. Res. 161: 106432 (2024) - [j46]Mengxi Tian, Hongyan Sang
Joint scheduling of AGVs and parallel machines in an automated electrode foil production factory. Expert Syst. Appl. 238(Part F): 122197 (2024) - [j45]Leilei Meng
MIP modeling of energy-conscious FJSP and its extended problems:From simplicity to complexity. Expert Syst. Appl. 241: 122594 (2024) - [j44]Xue Wang, Wen-Qiang Zou
Effective metaheuristic and rescheduling strategies for the multi-AGV scheduling problem with sudden failure. Expert Syst. Appl. 250: 123473 (2024) - [j43]Weiwei Wang, Biao Zhang, Xuchu Jiang, Baoxian Jia, Hongyan Sang, Leilei Meng:
Decomposition-based multi-objective approach for a green hybrid flowshop rescheduling problem with consistent sublots. Int. J. Prod. Res. 62(21): 7904-7932 (2024) - [j42]Wen-Qiang Zou
An effective population-based iterated greedy algorithm for solving the multi-AGV scheduling problem with unloading safety detection. Inf. Sci. 657: 119949 (2024) - [j41]Xiaoqing Han, Weiyao Cheng, Leilei Meng
A dual population collaborative genetic algorithm for solving flexible job shop scheduling problem with AGV. Swarm Evol. Comput. 86: 101538 (2024) - [j40]Peng Duan, Zhenao Yu, Kaizhou Gao, Leilei Meng
Solving the multi-objective path planning problem for mobile robot using an improved NSGA-II algorithm. Swarm Evol. Comput. 87: 101576 (2024) - [j39]Peng He, Biao Zhang
Optimizing distributed reentrant heterogeneous hybrid flowshop batch scheduling problem: Iterative construction-local search-reconstruction algorithm. Swarm Evol. Comput. 90: 101681 (2024) - [j38]Chang-Zhe Zheng, Hong-yan Sang
A self-adaptive memetic algorithm with Q-learning for solving the multi-AGVs dispatching problem. Swarm Evol. Comput. 90: 101697 (2024) - 2023
- [j37]Biao Zhang, Leilei Meng
Real-time data-driven automatic design of multi-objective evolutionary algorithm: A case study on production scheduling. Appl. Soft Comput. 138: 110187 (2023) - [j36]Yuanzhen Li
A problem-specific knowledge based artificial bee colony algorithm for scheduling distributed permutation flowshop problems with peak power consumption. Eng. Appl. Artif. Intell. 126: 107011 (2023) - [j35]Wen-Qiang Zou, Quan-Ke Pan, Leilei Meng, Hong-yan Sang, Yu-yan Han, Junqing Li:
An effective self-adaptive iterated greedy algorithm for a multi-AGVs scheduling problem with charging and maintenance. Expert Syst. Appl. 216: 119512 (2023) - [j34]Biao Zhang, Chao Lu, Leilei Meng
Reconfigurable distributed flowshop group scheduling with a nested variable neighborhood descent algorithm. Expert Syst. Appl. 217: 119548 (2023) - [j33]Biao Zhang, Quan-Ke Pan
A decomposition-based multi-objective evolutionary algorithm for hybrid flowshop rescheduling problem with consistent sublots. Int. J. Prod. Res. 61(3): 1013-1038 (2023) - [j32]Leilei Meng
An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem. Sensors 23(8): 3815 (2023) - [j31]Leilei Meng
MILP modeling and optimization of multi-objective flexible job shop scheduling problem with controllable processing times. Swarm Evol. Comput. 82: 101374 (2023) - [j30]Wen-Qiang Zou
An effective multi-objective adaptive iterated greedy algorithm for semi-open multi-AGV scheduling problem with charging and maintenance. Swarm Evol. Comput. 83: 101413 (2023) - [j29]Yaping Ren
A Self-Adaptive Learning Approach for Uncertain Disassembly Planning Based on Extended Petri Net. IEEE Trans. Ind. Informatics 19(12): 11889-11897 (2023) - 2022
- [j28]Zhong-Kai Li
An effective discrete invasive weed optimization algorithm for multi-AGVs dispatching problem with specific cases in matrix manufacturing workshop. Comput. Ind. Eng. 174: 108755 (2022) - [j27]Chang Lv, Chaoyong Zhang, Yaping Ren
A fuzzy correlation based heuristic for Dual-mode integrated Location routing problem. Comput. Oper. Res. 146: 105923 (2022) - [j26]Xinli Zhang, Biao Zhang, Leilei Meng
An evolutionary algorithm for a hybrid flowshop scheduling problem with consistent sublots. Int. J. Autom. Control. 16(1): 19-44 (2022) - [j25]Biao Zhang, Quan-Ke Pan, Leilei Meng
An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots. Knowl. Based Syst. 238: 107819 (2022) - [j24]Heng-Wei Guo
An effective metaheuristic with a differential flight strategy for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Knowl. Based Syst. 242: 108328 (2022) - [j23]Chao Lu
A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers. Robotics Comput. Integr. Manuf. 74: 102277 (2022) - [j22]Hao-Xiang Qin, Yu-Yan Han
An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem. Swarm Evol. Comput. 69: 100992 (2022) - [j21]Leilei Meng
Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 71: 101058 (2022) - 2021
- [j20]Biao Zhang, Quan-Ke Pan, Leilei Meng
A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots. Appl. Soft Comput. 106: 107305 (2021) - [j19]Jinxiu Zhu, Leilei Meng
Generative adversarial network-based atmospheric scattering model for image dehazing. Digit. Commun. Networks 7(2): 178-186 (2021) - [j18]Yingli Li, Xinyu Li, Liang Gao
A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Int. J. Prod. Res. 59(13): 3880-3899 (2021) - [j17]Yu Du, Jun-Qing Li, Chao Luo, Leilei Meng
A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations. Swarm Evol. Comput. 62: 100861 (2021) - [j16]Yaping Ren
A Multiobjective Disassembly Planning for Value Recovery and Energy Conservation From End-of-Life Products. IEEE Trans Autom. Sci. Eng. 18(2): 791-803 (2021) - [c5]Heng-Wei Guo, Hong-yan Sang, Jun-qing Li, Yu-yan Han, Biao Zhang, Leilei Meng
An Improved SMA Algorithm for Solving Global Optimization Problems. ICIC (1) 2021: 619-634 - 2020
- [j15]Leilei Meng
MILP Modeling and Optimization of Energy- Efficient Distributed Flexible Job Shop Scheduling Problem. IEEE Access 8: 191191-191203 (2020) - [j14]Leilei Meng
Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput. Ind. Eng. 142: 106347 (2020) - [j13]Yingli Li, Xinyu Li
An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times. Comput. Ind. Eng. 147: 106638 (2020) - [j12]Yaping Ren
An improved general variable neighborhood search for a static bike-sharing rebalancing problem considering the depot inventory. Expert Syst. Appl. 160: 113752 (2020) - [j11]Leilei Meng
More MILP models for hybrid flow shop scheduling problem and its extended problems. Int. J. Prod. Res. 58(13): 3905-3930 (2020) - [j10]Qi Lu, Yaping Ren
A hybrid metaheuristic algorithm for a profit-oriented and energy-efficient disassembly sequencing problem. Robotics Comput. Integr. Manuf. 61: 101828 (2020) - [j9]Yaping Ren
Rebalancing Bike Sharing Systems for Minimizing Depot Inventory and Traveling Costs. IEEE Trans. Intell. Transp. Syst. 21(9): 3871-3882 (2020) - [j8]Yaping Ren
An MCDM-Based Multiobjective General Variable Neighborhood Search Approach for Disassembly Line Balancing Problem. IEEE Trans. Syst. Man Cybern. Syst. 50(10): 3770-3783 (2020) - [j7]Biao Zhang
A Three-Stage Multiobjective Approach Based on Decomposition for an Energy-Efficient Hybrid Flow Shop Scheduling Problem. IEEE Trans. Syst. Man Cybern. Syst. 50(12): 4984-4999 (2020) - [j6]Xin Su
Intelligent Maritime Networking With Edge Services and Computing Capability. IEEE Trans. Veh. Technol. 69(11): 13606-13620 (2020)
2010 – 2019
- 2019
- [j5]Leilei Meng
Mathematical Modeling and Optimization of Energy-Conscious Flexible Job Shop Scheduling Problem With Worker Flexibility. IEEE Access 7: 68043-68059 (2019) - [j4]Biao Zhang
A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem. Comput. Ind. Eng. 136: 325-344 (2019) - [j3]Leilei Meng
Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines. Int. J. Prod. Res. 57(4): 1119-1145 (2019) - 2018
- [j2]Xin Su, Leilei Meng
Fine-Grained Big Traffic Data Reverse-charge System: A Method of Saving Expenses. Mob. Networks Appl. 23(4): 1082-1088 (2018) - [c4]Leilei Meng
Urban Data Acquisition Routing Approach for Vehicular Sensor Networks. GPC 2018: 64-76 - [c3]Leilei Meng
Signal reception for successive interference cancellation in NOMA downlink. RACS 2018: 75-79 - 2017
- [j1]Yaping Ren
An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem. Int. J. Prod. Res. 55(24): 7302-7316 (2017) - [c2]Leilei Meng
Study on the power consumption of different milling modes and number of inserts in face milling processes. CASE 2017: 1475-1480 - 2016
- [c1]Leilei Meng
A new model for predicting power consumption of machining processes: A turning case. CASE 2016: 1289-1294
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-11-14 00:54 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: