Aiiad Albeshri

King Abdulaziz University

Papers

6

Total Citations

113

H-Index

6

About

Aiiad Albeshri’s research bridges the gap between theoretical optimization and real-world cyber-physical systems, with a focus on scheduling, robotics, and high-performance computing. His work on wafer fabrication introduced a novel approach to cyclic scheduling for dual-arm cluster tools, addressing the critical challenge of wafer-residency-time constraints by optimizing processing module configurations and robot waiting times—a contribution that has earned 32 citations and offers practical solutions for semiconductor manufacturing. Albeshri also developed the ZAKI and ZAKI+ frameworks, machine learning-based tools that automatically optimize sparse matrix-vector multiplication (SpMV) on distributed memory architectures, achieving up to 22 citations for their impact on smart city and scientific applications. In robotics, he applied tabu search to avoid concave obstacles in source localization and proposed a learning-inspired immune algorithm for multiobjective multirobot maritime patrolling, both published in 2023. Additionally, his SVSL method for human activity recognition uses soft-voting and self-learning to improve accuracy in smart health and surveillance. With over 100 citations across these works, Albeshri’s contributions demonstrate a consistent ability to solve complex, interdisciplinary problems, making him a notable figure in optimization, robotics, and cyber-physical systems research.

Research Focus

Key Achievements

6
H-Index
6
Papers
113
Total Citations
19
Avg Citations/Paper
🏆 Most Cited Paper
Optimal Cyclic Scheduling of Wafer-Residency-Time-Constrained Dual-Arm Cluster Tools by Configuring Processing Modules and Robot Waiting Time
32 citations · 2023
📈 Most Prolific Year: 2023 (3 Papers)
🤝 Key Collaborators: 17
🏛 Institutions: King Abdulaziz University

Top Papers

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 13 days ago