Skip to content
akaturk Academic measurement
  1. Ana Dal Fen Bilimleri ve Matematik Temel Alanı
  2. Yan Dal Matematik
Articles 17 YÖKSİS 17 · OpenAlex 0 Total citations 41 h-index 3 · OpenAlex OpenAlex coverage %35 matched 6 / 17 Q1 articles 3 Scopus · WoS Q1 1 Best field rank #216 / 570 Keyword · top 37.9% Co-authors 4 0 Turkish institutions

Citation impact

OpenAlex YÖKSİS articles matched in OpenAlex: 6
h-index 3 Percentile in Türkiye: 42 #584 of 1,164 at their university by h-index
i10-index
2
Total citations
41
Top 51% in Türkiye
Per article
6.8
FWCI
0.80
1.00 = world average
World top 1%
0
World top 10%
0
How is this computed?

h-index and citations are computed from the citation counts of this academic’s YÖKSİS articles matched in OpenAlex (not Google Scholar, WoS or Scopus). Unmatched articles are not included.

Citing publications

Crossref 11 publications citing 6 DOI-bearing articles · 7 Türkiye-affiliated

2020 42021 62022 1

  1. A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times TR Muberra ALLAHVERDİ · Uluslararası Muhendislik Arastirma ve Gelistirme Dergisi · 2022
  2. Minimizing total completion time for flowshop scheduling problem with uncertain processing times TR Muberra Allahverdi et al. · RAIRO - Operations Research · 2021 · cites 2 articles of this academic
  3. A better dominance relation and heuristics for Two-Machine No-Wait Flowshops with Maximum Lateness Performance Measure TR Muberra Allahverdi et al. · Journal of Industrial & Management Optimization · 2021
  4. An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times TR Ali ALLAHVERDİ et al. · Uluslararası Muhendislik Arastirma ve Gelistirme Dergisi · 2021 · cites 2 articles of this academic
  5. 10.1051/ro/2020121 2021
  6. 10.1016/j.ins.2020.06.052 2021
  7. 10.2355/isijinternational.isijint-2020-258 2021
  8. No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan TR Ali Allahverdi et al. · Applied Mathematics and Computation · 2020
  9. Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan TR Muberra Allahverdi et al. · RAIRO - Operations Research · 2020
  10. Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times TR Harun Aydilek et al. · Engineering Optimization · 2020 · cites 2 articles of this academic
  11. 10.1109/access.2020.3015737 2020
Where does this list come from?

Extracted from the reference lists in Crossref’s public March 2026 data file; 18.4% of the file has been processed, so the list may be incomplete. Crossref citations are never added to or compared with the OpenAlex citation counts; the two sources have different coverage.

Field ranking

YÖKSİS ?
Keyword rankings 2

Collaboration network

From the author lists of YÖKSİS publication records. Duplicate records of a work count once; institutions are co-authors’ current YÖKSİS affiliations.

Co-authors
4
With an akaturk profile
0
Turkish institutions
0
Co-authored works
%65

Academic co-authors 0

No co-author with an akaturk profile.

National collaboration 0 institutions

No joint work with another Turkish university.

Other co-authors (incl. international) 4

Ali Allahverdi 10Asiye Aydilek 2Harun Aydilek 2Alexandre Tchernev

Authors without an akaturk profile (international researchers, retired or former academics, students, clinicians) are grouped by name spelling; short forms such as “Gulluce M.” join the single full name they match.

Indexes and citation percentiles

?
TR Index 1 articles
OpenAlex citation percentile
Top 1%0
Top 10%0
Avg · n 6 %62.9
Other counts

Scopus (SJR)

  • YÖKSİS rows 11

WoS (JCR)

  • YÖKSİS rows 11

Articles

Articles with YÖKSİS and OpenAlex source split; narrow by quartile or TR Index.

17articles

Journals with publications

11 journals

Narrow down

Scopus (SJR)
Q13 Q21 Q37 Q40
WoS (JCR)
TR Index

Article list

  1. 2023 Three-Machine Flowshop Scheduling Problem to Minimize Makespan with Interval Processing Times International Journal of Advanced Research in Engineering Innovation 2 YÖKSİS records YÖKSİS
  2. 2023 Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times Hacettepe Journal of Mathematics and Statistics YÖKSİS TR Index SJR Q3 JCR Q2
  3. 2023 Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times RAIRO Operations Research s DOI 10.1051/ro/2023091 YÖKSİS SJR Q3 JCR Q3 OpenAlex 53.5%
  4. 2023 Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times RAIRO Operations Research DOI 10.1051/ro/2023023 YÖKSİS SJR Q3 JCR Q3 OpenAlex 61.1%
  5. 2022 An improved algorithm to minimize the total completion time in a two-machine no-wait flowshop with uncertain setup times JOURNAL OF PROJECT MANAGEMENT YÖKSİS SJR Q1 JCR Q1
  6. 2022 More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness International Journal of Industrial Engineering Computations YÖKSİS SJR Q1 JCR Q2 OpenAlex 79.1%
  7. 2022 A new dominance relation no-wait flowshop scheduling problems with interval setup times International Journal of Advanced Research in Engineering Innovation YÖKSİS
  8. 2022 A substantially improved new algorithm for flowshop scheduling problem with uncertain processing times International Journal of Engineering Research and Development YÖKSİS
  9. 2021 Minimizing total completion time for flowshop scheduling problem with uncertain processing times RAIRO Operations Research YÖKSİS SJR Q2 JCR Q4
  10. 2021 A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure Journal of Industrial and Management Optimization YÖKSİS SJR Q3 JCR Q3
  11. 2021 Four-machine flowshop scheduling problem with uncertain processing times to minimize mean completion time International Journal of Business and Technology Management YÖKSİS
  12. 2021 Minimizing makespan for flowshop scheduling problem with random and bounded processing times International Journal of Business and Technology Management YÖKSİS
  13. 2021 An improved algorithm for minimizing makespan on flowshops with uncertain processing times International Journal of Engineering Research and Development YÖKSİS
  14. 2020 Algorithms for Four-machine flowshop scheduling problem with uncertain processing times to minimize makespan RAIRO Operations Research YÖKSİS SJR Q3 JCR Q4 OpenAlex 82.5%
  15. 2020 Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times Journal of Industrial and Management Optimization YÖKSİS SJR Q3 JCR Q3
  16. 2019 Acyclicity of Schur Complexes and Torsion Freeness of Schur Modules. JOURNAL OF ALGEBRA YÖKSİS SJR Q1 JCR Q3 OpenAlex 12.7%
  17. 2018 Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness Computational and Applied Mathematics DOI 10.1007/s40314-018-0694-3 YÖKSİS SJR Q3 JCR Q2 OpenAlex 88.6%

← Back to academicians