İçeriğe geç
akaturk Akademik ölçüm

Akademisyen

MÜBERRA ALLAHVERDİ

DOÇENT

ANKARA YILDIRIM BEYAZIT ÜNİVERSİTESİ MÜHENDİSLİK VE DOĞA BİLİMLERİ FAKÜLTESİ MATEMATİK BÖLÜMÜ

  • Ana Dal Fen Bilimleri ve Matematik Temel Alanı
  • Yan Dal Matematik

Kayıtlı çıktılara kısa bakış — ayrıntılar aşağıda.

  • Makale 18
  • Proje 0
  • Kitap 0
  • Bildiri 20
  • Patent 0
  • Sanatsal 0
Scopus (SJR) Q1 3 Q2 1 Q3 7 Q4 0
WoS (JCR) Q1 1 Q2 3 Q3 5 Q4 2
TR Index 1 makale

Alan+yıl+tür normalize OpenAlex yüzdelik — Clarivate ESI / SciVal değildir.

Üst %1 makale 0
Üst %10 makale 0
Ort. yüzdelik 67.8%
Üst %1 payı 0.0%
Üst %10 payı 0.0%

Makaleler

YÖKSİS ve OpenAlex kaynak ayrımıyla makaleler; quartile ve TR Index ile daraltabilirsiniz.

Dizin filtreleri

Toplam 18 yayın

Makale listesi

  1. 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%
  2. 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%
  3. 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%
  4. 2023 Three-Machine Flowshop Scheduling Problem to Minimize Makespan with Interval Processing Times International Journal of Advanced Research in Engineering Innovation YÖKSİS
  5. 2023 Three-Machine Flowshop Scheduling Problem to Minimize Makespan with Interval Processing Times International Journal of Advanced Research in Engineering Innovation YÖKSİS
  6. 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
  7. 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
  8. 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
  9. 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
  10. 2022 A substantially improved new algorithm for flowshop scheduling problem with uncertain processing times International Journal of Engineering Research and Development YÖKSİS
  11. 2021 Minimizing total completion time for flowshop scheduling problem with uncertain processing times RAIRO Operations Research YÖKSİS SJR Q2 JCR Q4
  12. 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
  13. 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
  14. 2021 Minimizing makespan for flowshop scheduling problem with random and bounded processing times International Journal of Business and Technology Management YÖKSİS
  15. 2021 An improved algorithm for minimizing makespan on flowshops with uncertain processing times International Journal of Engineering Research and Development YÖKSİS
  16. 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
  17. 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
  18. 2019 Acyclicity of Schur Complexes and Torsion Freeness of Schur Modules. JOURNAL OF ALGEBRA YÖKSİS SJR Q1 JCR Q3

Akademisyenlere dön