![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Xue-Lei Jing
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Chuang Wang
, Quan-Ke Pan
, Xue-Lei Jing
:
An effective adaptive iterated greedy algorithm for a cascaded flowshop joint scheduling problem. Expert Syst. Appl. 238(Part A): 121856 (2024) - [j9]Qiu-Ying Li, Quan-Ke Pan
, Hongyan Sang, Xue-Lei Jing
, Jose M. Framiñan, Wei-Min Li:
Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint. Expert Syst. Appl. 248: 123278 (2024) - [j8]Chuang Wang, Quan-Ke Pan, Hong-yan Sang, Xue-Lei Jing
:
A cascaded flowshop joint scheduling problem with makespan minimization: A mathematical model and shifting iterated greedy algorithm. Swarm Evol. Comput. 86: 101489 (2024) - 2023
- [j7]Zhen Lin
, Xue-Lei Jing
, Baoxian Jia:
An iterated greedy algorithm for distributed flowshops with tardiness and rejection costs to maximize total profit. Expert Syst. Appl. 233: 120830 (2023) - [j6]Zhi-Yuan Wang, Quan-Ke Pan, Liang Gao
, Xue-Lei Jing
, Qing Sun:
A cooperative iterated greedy algorithm for the distributed flowshop group robust scheduling problem with uncertain processing times. Swarm Evol. Comput. 79: 101320 (2023) - 2022
- [j5]Yuanzhen Li, Quan-Ke Pan, Xuan He, Hongyan Sang, Kai-Zhou Gao
, Xue-Lei Jing:
The distributed flowshop scheduling problem with delivery dates and cumulative payoffs. Comput. Ind. Eng. 165: 107961 (2022) - [j4]Xue-Lei Jing, Quan-Ke Pan
, Liang Gao
, Ling Wang
:
An Effective Iterated Greedy Algorithm for a Robust Distributed Permutation Flowshop Problem With Carryover Sequence-Dependent Setup Time. IEEE Trans. Syst. Man Cybern. Syst. 52(9): 5783-5794 (2022) - 2021
- [j3]Xue-Lei Jing, Quan-Ke Pan
, Liang Gao
:
Local search-based metaheuristics for the robust distributed permutation flowshop problem. Appl. Soft Comput. 105: 107247 (2021) - [j2]Liang Sun, Quan-Ke Pan
, Xue-Lei Jing, Jiang-Ping Huang:
A light-robust-optimization model and an effective memetic algorithm for an open vehicle routing problem under uncertain travel times. Memetic Comput. 13(2): 149-167 (2021) - 2020
- [j1]Xue-Lei Jing, Quan-Ke Pan
, Liang Gao
, Yu-Long Wang:
An effective Iterated Greedy algorithm for the distributed permutation flowshop scheduling with due windows. Appl. Soft Comput. 96: 106629 (2020)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint