Tuğba Saraç

601 total citations
47 papers, 384 citations indexed

About

Tuğba Saraç is a scholar working on Industrial and Manufacturing Engineering, Control and Systems Engineering and Aerospace Engineering. According to data from OpenAlex, Tuğba Saraç has authored 47 papers receiving a total of 384 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Industrial and Manufacturing Engineering, 5 papers in Control and Systems Engineering and 5 papers in Aerospace Engineering. Recurrent topics in Tuğba Saraç's work include Advanced Manufacturing and Logistics Optimization (23 papers), Scheduling and Optimization Algorithms (16 papers) and Assembly Line Balancing Optimization (15 papers). Tuğba Saraç is often cited by papers focused on Advanced Manufacturing and Logistics Optimization (23 papers), Scheduling and Optimization Algorithms (16 papers) and Assembly Line Balancing Optimization (15 papers). Tuğba Saraç collaborates with scholars based in Türkiye, Australia and United Arab Emirates. Tuğba Saraç's co-authors include Aydın Sipahioğlu, Sezen Köse, Muhammed Tayyib Kadak, Emre Bora, Rafail N. Gasimov, Refail Kasımbeyli, Fehmi Burçin Özsoydan, Müjgân Sağır, Pınar Aytar Çelik and Berna Ulutaş and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and International Journal of Production Research.

In The Last Decade

Tuğba Saraç

35 papers receiving 369 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Tuğba Saraç Türkiye 10 274 40 34 33 31 47 384
Jiayi Li China 7 137 0.5× 9 0.2× 10 0.3× 18 0.5× 17 0.5× 13 281
Alan H. Bond United States 8 57 0.2× 42 1.1× 64 1.9× 24 0.7× 6 0.2× 27 218
Caroline E. Harriott United States 10 28 0.1× 63 1.6× 47 1.4× 19 0.6× 3 0.1× 20 295
Shih-Wen Hsiao Taiwan 9 33 0.1× 19 0.5× 14 0.4× 6 0.2× 2 0.1× 18 426
Grażyna Ślusarczyk Poland 10 72 0.3× 23 0.6× 32 0.9× 17 0.5× 31 237
Abdullah Alsheddy Saudi Arabia 8 64 0.2× 13 0.3× 48 1.4× 14 0.4× 19 186
Pere Ponsa Spain 9 44 0.2× 23 0.6× 25 0.7× 9 0.3× 48 287
Doris Aschenbrenner Germany 9 74 0.3× 19 0.5× 22 0.6× 28 0.8× 41 255
Frieder Loch Germany 10 93 0.3× 11 0.3× 17 0.5× 51 1.5× 1 0.0× 21 288
Aurélie Clodic France 5 27 0.1× 48 1.2× 153 4.5× 14 0.4× 1 0.0× 13 349

Countries citing papers authored by Tuğba Saraç

Since Specialization
Citations

This map shows the geographic impact of Tuğba Saraç's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tuğba Saraç with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tuğba Saraç more than expected).

Fields of papers citing papers by Tuğba Saraç

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tuğba Saraç. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tuğba Saraç. The network helps show where Tuğba Saraç may publish in the future.

Co-authorship network of co-authors of Tuğba Saraç

This figure shows the co-authorship network connecting the top 25 collaborators of Tuğba Saraç. A scholar is included among the top collaborators of Tuğba Saraç based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tuğba Saraç. Tuğba Saraç is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Saraç, Tuğba, et al.. (2024). A simulated annealing algorithm for the faculty-level university course timetabling problem. Pamukkale University Journal of Engineering Sciences. 30(1). 17–30. 1 indexed citations
3.
Saraç, Tuğba, et al.. (2024). A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles. Journal of Heuristics. 30(5-6). 359–396.
4.
Saraç, Tuğba, et al.. (2023). Çok amaçlı ilişkisiz paralel makine çizelgeleme problemi için bir matsezgisel algoritma. Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi. 38(3). 1953–1966.
5.
Saraç, Tuğba, et al.. (2023). A multi-objective nonlinear integer programming model for mixed runway operations within the TMAs. The Aeronautical Journal. 128(1320). 340–370. 3 indexed citations
6.
Saraç, Tuğba, et al.. (2023). Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times. Operational Research. 23(3). 3 indexed citations
7.
Saraç, Tuğba, et al.. (2023). A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting. Computers & Operations Research. 155. 106222–106222. 40 indexed citations
8.
Saraç, Tuğba, et al.. (2022). Kullanılamayan Zaman Dilimlerinin ve Sıra Bağımlı Hazırlık Sürelerinin Olduğu Paralel Makina Çizelgeleme Problemi. SHILAP Revista de lepidopterología. 10(3). 588–600.
9.
Saraç, Tuğba, et al.. (2022). Emission and Flight Time Optimization Model for Aircraft Landing Problem. Transportation Research Record Journal of the Transportation Research Board. 2677(2). 763–773. 4 indexed citations
10.
Saraç, Tuğba, et al.. (2022). Estimation of biosurfactant production parameters and yields without conducting additional experiments on a larger production scale. Journal of Microbiological Methods. 202. 106597–106597. 7 indexed citations
11.
Saraç, Tuğba, et al.. (2021). A mixed integer nonlinear model for air refueling optimization to save fuel in military deployment operations. International journal of industrial engineering. 27(4). 2 indexed citations
12.
Saraç, Tuğba, et al.. (2021). Çok kaynaklı genelleştirilmiş atama probleminde ajan yüklerinin dengelenmesi için bir hedef programlama modeli. Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi. 37(1). 193–206.
13.
Saraç, Tuğba, et al.. (2021). A stochastic approach for the single-machine scheduling problem to minimize total expected cost with client-dependent tardiness costs. Engineering Optimization. 54(7). 1178–1192. 4 indexed citations
14.
Saraç, Tuğba & Müjgân Sağır. (2020). Teknik kısıtlı 1,5 boyutlu kesme problemi için karma tamsayılı matematiksel modeller. Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi. 36(1). 291–302. 1 indexed citations
15.
Saraç, Tuğba, et al.. (2020). A Goal Programming Model for The Make-up/Compensation Examination Problem. Pamukkale University Journal of Engineering Sciences. 26(1). 203–210. 1 indexed citations
16.
Saraç, Tuğba, et al.. (2019). SOLUCAN GÜBRESİ ÜRETİM TESİSİ İÇİN BİR KARAR DESTEK SİSTEMİ. 27(2). 85–92. 1 indexed citations
17.
Saraç, Tuğba, et al.. (2019). Single machine scheduling problem with stochastic sequence-dependent setup times. International Journal of Production Research. 57(10). 3273–3289. 21 indexed citations
18.
Özsoydan, Fehmi Burçin & Tuğba Saraç. (2011). A DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM FOR BICRITERIA WAREHOUSE LOCATION PROBLEM. RePEc: Research Papers in Economics. 114–124. 1 indexed citations
19.
Saraç, Tuğba & Fehmi Burçin Özsoydan. (2011). A DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM FOR BICRITERIA WAREHOUSE LOCATION PROBLEM. DergiPark (Istanbul University). 2 indexed citations
20.
Saraç, Tuğba, et al.. (2010). A two-objective mathematical model without cutting patterns for one-dimensional assortment problems. Journal of Computational and Applied Mathematics. 235(16). 4663–4674. 15 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026