Çankaya GCRIS Standart veritabanının içerik oluşturulması ve kurulumu Research Ecosystems (https://www.researchecosystems.com) tarafından devam etmektedir. Bu süreçte gördüğünüz verilerde eksikler olabilir.

Yazılım Mühendisliği Bölümü Yayın Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/2147

Browse

Browsing Yazılım Mühendisliği Bölümü Yayın Koleksiyonu by Author "107251"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Citation Count: A Comparative Evaluation of Popular Search Engınes On Finding Turkish Documents For A Specific Time Period (2017). Bitirim, Yiltan; Gorur, Abdul Kadir, Tehnicki Vjesnik-Technical Gazette, 24(2), 565-569.
    A Comparative Evaluation Of Popular Search Engines On Finding Turkish Documents For A Specific Time Period
    (Univ Osijek, Tech Fac, 2017) Bitirim, Yıltan; Görür, Abdül Kadir; 107251
    This study evaluates the popular search engines, Google, Yahoo, Bing, and Ask, on finding Turkish documents by comparing their current performances with their performances measured six years ago. Furthermore, the study reveals the current information retrieval effectiveness of the search engines. First of all, the Turkish queries were run on the search engines separately. Each retrieved document was classified and precision ratios were calculated at various cut-off points for each query and engine pair. Afterwards, these ratios were compared with the six years ago ratios for the evaluations. Besides the descriptive statistics, Mann-Whitney U and Kruskal-Wallis H statistical tests were used in order to find out statistically significant differences. All search engines, except Google, have better performance today. Bing has the most increased performance compared to six years ago. Nowadays: Yahoo has the highest mean precision ratios at various cut-off points; all search engines have their highest mean precision ratios at cut-off point 5; dead links were encountered in Google, Bing, and Ask; and repeated documents were encountered in Google and Yahoo.
  • Thumbnail Image
    Article
    Citation Count: Cetinkaya, F. C.; Catmakas, H. A.; Gorur, A. K., "Single-Machine Scheduling of Indivisible Multi-Operatıon Jobs", South African Journal of Industrial Engineering, Vol. 30, No. 1, pp. 78-93, (May 2019).
    Single-Machine Scheduling of Indivisible Multi-Operatıon Jobs
    (Southern African Inst Industrial Engineering, 2019) Çetinkaya, Ferda Can; Akkocaoğlu Çatmakaş, Hale; Görür, Abdül Kadir; 50129; 57532; 107251
    This paper considers a single-machine scheduling problem of multi-operation jobs where each job consists of several operations processed contiguously, rather than being intermingled with the operations of different jobs. That is, the jobs are indivisible. A sequence-independent setup is required if the machine switches from one operation to another. However, no setup is necessary before the first operation of a job if this first operation is the same as the last operation of the immediately previous job. A job is complete when all of its operations have been processed. We investigate the problem for two cases. Makespan, which is the time needed to complete all jobs, is minimised in the first case; whereas the total completion time, which is the sum of the job completion times, is minimised in the second case. We show that the makespan problem is solvable in polynomial time. For the problem of minimising total completion time, we develop a mixed integer linear programming (MILP) model, which is capable of solving small and medium-sized problem instances optimally, and obtain a very small gap between the solution found and the best possible solution for the unsolved large-sized problem instances.