Academician
MÜBERRA ALLAHVERDİ
Doçent
Ankara Yıldırım Beyazıt Üniversitesi Mühendislik Ve Doğa Bilimleri Fakültesi Matematik Bölümü
- Ana Dal Fen Bilimleri ve Matematik Temel Alanı
- Yan Dal Matematik
Citation impact
OpenAlex YÖKSİS articles matched in OpenAlex: 6- 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
Most cited articles
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness
- Algorithms for Four-machine flowshop scheduling problem with uncertain processing times to minimize makespan
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-affiliated2020 42021 62022 1
- A Substantially Improved New Algorithm for Flowshop Scheduling Problem with Uncertain Processing Times TR Muberra ALLAHVERDİ · Uluslararası Muhendislik Arastirma ve Gelistirme Dergisi · 2022
- 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
- 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
- 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
- 10.1051/ro/2020121 2021
- 10.1016/j.ins.2020.06.052 2021
- 10.2355/isijinternational.isijint-2020-258 2021
- 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
- Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan TR Muberra Allahverdi et al. · RAIRO - Operations Research · 2020
- 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
- 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 ?-
Main field Fen Bilimleri ve Matematik Temel AlanıPoints rank #7,088/ 11,969 top 59.2% At university #16/ 37Score 9.6 journal 9.6 · OA add 0
- Article rank6,797/11,969
- Scopus rank6,728/11,969
- WoS rank6,586/11,969
- YÖKSİS17
- Scopus11
- WoS11
-
Side field MatematikPoints rank #1,116/ 2,590 top 43.1% At university #4/ 11Score 9.6 journal 9.6 · OA add 0
- Article rank1,122/2,590
- Scopus rank1,042/2,590
- WoS rank991/2,590
- YÖKSİS17
- Scopus11
- WoS11
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
?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.
Journals with publications
11 journals
- RAIRO - Operations Research 4
- ISSN 2278-800X 2
- ISSN 2581-3889 2
- Journal of Industrial and Management Optimization 2
- ISSN 2023-0930 1
- ISSN 2682-8499 1
- Computational and Applied Mathematics 1
- Hacettepe Journal of Mathematics and Statistics 1
- International Journal of Industrial Engineering Computations 1
- International Journal of Project Management 1
- Journal of Algebra 1
Narrow down
Article list
- 2023 Three-Machine Flowshop Scheduling Problem to Minimize Makespan with Interval Processing Times YÖKSİS
- 2023 Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times YÖKSİS TR Index SJR Q3 JCR Q2
- 2023 Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times YÖKSİS SJR Q3 JCR Q3 OpenAlex 53.5%
- 2023 Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times YÖKSİS SJR Q3 JCR Q3 OpenAlex 61.1%
- 2022 An improved algorithm to minimize the total completion time in a two-machine no-wait flowshop with uncertain setup times YÖKSİS SJR Q1 JCR Q1
- 2022 More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness YÖKSİS SJR Q1 JCR Q2 OpenAlex 79.1%
- 2022 A new dominance relation no-wait flowshop scheduling problems with interval setup times YÖKSİS
- 2022 A substantially improved new algorithm for flowshop scheduling problem with uncertain processing times YÖKSİS
- 2021 Minimizing total completion time for flowshop scheduling problem with uncertain processing times YÖKSİS SJR Q2 JCR Q4
- 2021 A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure YÖKSİS SJR Q3 JCR Q3
- 2021 Four-machine flowshop scheduling problem with uncertain processing times to minimize mean completion time YÖKSİS
- 2021 Minimizing makespan for flowshop scheduling problem with random and bounded processing times YÖKSİS
- 2021 An improved algorithm for minimizing makespan on flowshops with uncertain processing times YÖKSİS
- 2020 Algorithms for Four-machine flowshop scheduling problem with uncertain processing times to minimize makespan YÖKSİS SJR Q3 JCR Q4 OpenAlex 82.5%
- 2020 Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times YÖKSİS SJR Q3 JCR Q3
- 2019 Acyclicity of Schur Complexes and Torsion Freeness of Schur Modules. YÖKSİS SJR Q1 JCR Q3 OpenAlex 12.7%
- 2018 Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness YÖKSİS SJR Q3 JCR Q2 OpenAlex 88.6%