default search action
Yuting Wang 0003
Person information
- affiliation: Liaocheng University, College of Computer Science, China
Other persons with the same name
- Yuting Wang (aka: YuTing Wang, Yu-Ting Wang) — disambiguation page
- Yuting Wang 0001
— Shanghai Jiao Tong University, John Hopcroft Center for Computer Science, Shanghai, China (and 2 more)
- Yu-Ting Wang 0002
- Yuting Wang 0004 — Rutgers University, Department of Computer Science, Piscataway, NJ, USA (and 1 more)
- Yu-Ting Wang 0005 (aka: Yuting Wang 0005) — McMaster University, Department of Electrical and Computer Engineering, Hamilton, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j16]Chenyao Zhang
An accelerated discrete artificial bee colony algorithm under the makespan constraint: Solving the distributed blocking flow shop scheduling problem with balanced energy consumption costs. Expert Syst. Appl. 260: 125374 (2025) - 2024
- [j15]Qianhui Ji, Yuyan Han, Yuting Wang, Biao Zhang, Kaizhou Gao:
A Penalty Groups-Assisted Iterated Greedy Integrating Idle Time Insertion: Solving the Hybrid Flow Shop Group Scheduling with Delivery Time Windows. Complex Syst. Model. Simul. 4(2): 137-165 (2024) - [j14]Yuyan Han, Yuting Wang
Accelerated evaluation of blocking flowshop scheduling with total flow time criteria using a generalized critical machine-based approach. Eur. J. Oper. Res. 318(2): 424-441 (2024) - [j13]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) - [j12]Yuting Wang
Theoretical analysis and implementation of mandatory operations-based accelerated search in graph space for hybrid flow shop scheduling. Expert Syst. Appl. 257: 125026 (2024) - [j11]Chengshuai Li
A novel collaborative iterative greedy algorithm for hybrid flowshop scheduling problem with batch processing machines and variable sublots. Int. J. Prod. Res. 62(11): 4076-4096 (2024) - [j10]Yuting Wang, Yuyan Han
Theoretical analysis and methods of rapid evaluation: Solving the blocking flowshop group scheduling problem with the total flow time and total tardiness time criteria. Swarm Evol. Comput. 88: 101604 (2024) - 2023
- [j9]Mingpeng Miao, Hongyan Sang
Joint scheduling of parallel machines and AGVs with sequence-dependent setup times in a matrix workshop. Comput. Ind. Eng. 185: 109621 (2023) - [j8]Yong Wang, Yuting Wang, Yuyan Han, Junqing Li, Kaizhou Gao, Yusuke Nojima
Intelligent Optimization Under Multiple Factories: Hybrid Flow Shop Scheduling Problem with Blocking Constraints Using an Advanced Iterated Greedy Algorithm. Complex Syst. Model. Simul. 3(4): 282-306 (2023) - [j7]Yuhang Wang
Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem. Eur. J. Oper. Res. 311(3): 816-832 (2023) - [j6]Yuhang Wang
An effective two-stage iterated greedy algorithm for distributed flowshop group scheduling problem with setup time. Expert Syst. Appl. 233: 120909 (2023) - [j5]Yuting Wang, Yuyan Han
Redefining hybrid flow shop group scheduling: Unveiling a novel hybrid modeling paradigm and assessing 48 MILP and CP models. Swarm Evol. Comput. 83: 101416 (2023) - [j4]Haoxiang Qin
Energy-Efficient Iterative Greedy Algorithm for the Distributed Hybrid Flow Shop Scheduling With Blocking Constraints. IEEE Trans. Emerg. Top. Comput. Intell. 7(5): 1442-1457 (2023) - 2022
- [j3]Haoxiang Qin
Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem. Knowl. Based Syst. 258: 109962 (2022)
2010 – 2019
- 2012
- [j2]Kaizhou Gao
A Hybrid Harmony Search Algorithm for the no-Wait Flow-shop Scheduling Problems. Asia Pac. J. Oper. Res. 29(2) (2012) - 2011
- [j1]Yu-Ting Wang
Memetic Algorithm based on Improved Inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem. Comput. Math. Appl. 62(7): 2743-2754 (2011) - [c6]Yuting Wang
A Modified Inver-over Operator for the Traveling Salesman Problem. ICIC (2) 2011: 17-23 - [c5]Junqing Li, Yuanzhen Li, Huaqing Yang, Kaizhou Gao
Flexible Job Shop Scheduling Problem by Chemical-Reaction Optimization Algorithm. ICIC (1) 2011: 584-591 - [c4]Jian Sun, Yuting Wang, Junqing Li, Kaizhou Gao
Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem. ICNC 2011: 1518-1521 - 2010
- [c3]Yu-Ting Wang
Memetic algorithm based on improved inver-over operator for TSP. ICNC 2010: 2386-2389 - [c2]Junqing Li, Shengxian Xie, Quan-Ke Pan, Kaizhou Gao
A Novel Time Decaying Model for P2P Networks. MVHI 2010: 203-205 - [c1]Junqing Li, Shengxian Xie, Quan-Ke Pan, Kaizhou Gao
An Effective Trust-Based Search Approach in Peer-to-Peer Network. MVHI 2010: 206-209
Coauthor Index
aka: Kaizhou Gao
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-23 20:35 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: