Bekli, Rahime Şeyma

Profile Picture
Profile URL
https://hdl.handle.net/20.500.12573/2887
Name Variants
Bekli, Rahime Şeyma
Bekli, Seyma
Job Title
Dr. Öğr. Üyesi
Email Address
seyma.bekli@agu.edu.tr
Main Affiliation
02.02. Endüstri Mühendisliği
Status
Current Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
196916
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

9

INDUSTRY, INNOVATION AND INFRASTRUCTURE
INDUSTRY, INNOVATION AND INFRASTRUCTURE Logo

1

Research Products

12

RESPONSIBLE CONSUMPTION AND PRODUCTION
RESPONSIBLE CONSUMPTION AND PRODUCTION Logo

1

Research Products
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

3

Articles

0

Views / Downloads

300/184

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

0

Scopus Citation Count

3

WoS h-index

0

Scopus h-index

1

Patents

0

Projects

0

WoS Citations per Publication

0.00

Scopus Citations per Publication

1.00

Open Access Source

2

Supervised Theses

1

Google Analytics Visitor Traffic

JournalCount
Eurasia Proceedings of Science, Technology, Engineering and Mathematics2
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

201712024120251
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 1
    Incorporating Worker Heterogeneity in Flexible Flow Shop Environment
    (ISRES Publishing, 2025) Ozpacaci, Kubra; Bekli, Seyma; Kayisoglu, Betul
    We study the flexible flow shop scheduling problem with the heterogeneous worker assignment. In many real-life manufacturing systems with flow shop environments, one of the fundamental scheduling challenges that needs to be addressed is job sequences across multiple workers. In addition, the manufacturing system may require workers to have different skills at various stages during their assignment. Therefore, worker availability at each stage may vary during the scheduling horizon. Unlike traditional flexible flow shop scheduling problem, where homogeneous workers are assumed, we consider workers with different skill levels, capabilities, and capacities. We present a mixed integer linear programming model to find the optimal sequence of job assignments, guaranteeing that jobs follow their predefined operation sequence while assigning workers with various skill sets in a flexible flow shop environment. The proposed model is tested at a battery manufacturing company. By analyzing the solution, we confirm its capability to represent the problem accurately. The proposed model offers a systematic scheduling approach for a flexible flow shop environment with a heterogeneous workforce and can be implemented in other industries. © 2025 Elsevier B.V., All rights reserved.
  • Thumbnail Image
    Master Thesis
    Belirsiz İşlem Süresine Tabi Paralel Makine Çizelgelemeleri
    (Abdullah Gül Üniversitesi, Fen Bilimleri Enstitüsü, 2017) Bekli, Rahime Şeyma; Gören, Selçuk
    Günümüz dünyasında iş ve üretim rekabeti, firmaların verimlilik artıran ve imalat maliyetini düşüren çizelgeler üretmesine yol açmıştır. Ancak, üretilen çizelgeler beklenmedik aksaklıklar yüzünden, genellikle amaçlandığı şekilde uygulanamamaktadır. Bu aksaklıklar makine arızalanması, sipariş iptali gibi örneklendirilebilir. Aksaklıklara duyarsız çizelge olan gürbüz çizelgeleme, son yıllarda araştırmacılar arasında önem kazanmıştır. Bu çalışmada, belirsiz işlem süresine tabi paralel makine ortamı ele alınmıştır. Performans ölçütü son işin bitiş süresi olarak alınmıştır. Belirsizlik, ayrık senaryolar olarak modellenmiş ve küçük boyuttaki problemleri çözebilen bir tam sayılı programlama oluşturulmuştur. Bu model büyük problemleri çözmede sıkıntılıdır. Bu sebeple senaryo sayısını azaltma yaklaşımı denenmiştir. Daha sonra eşiz ayrıştırma yöntemi ile büyük problemlerin çözümü amaçlanmıştır. Bu yöntemi kullanmadaki amaç büyük bir problem çözmek yerine, küçük ama çok sayıda problem çözerek sonuca ulaşmaktır. Ancak bu yöntem de büyük problemlerde istenilen sonuçları vermemiştir. Bu sebeple senaryo sayısı azaltılarak eşiz ayrıştırma yöntemi kullanılmış ve yeni bir sezgisel önerilmiştir. Aynı zamanda bir tabu arama algoritması oluşturulmuştur. Sonuçlar, önerilen sezgisel algoritmalardan senaryo azaltılması ve tabu arama algoritmalarının paralel makine ortamında iyi sonuçlar verdiğini göstermektedir.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 2
    Parallel Machine Scheduling With Re-Entrant Jobs With Consideration of Set Up Times
    (ISRES Publishing, 2024) Kayisoglu, Betul; Bekli, Seyma; Sahin, Ayse Sena; Akyurek, Gamze Gul; Aydinli, Ruveyda; Copur, Sevda Nur; Ekinci, Tugba
    We study the identical parallel machine problem with re-entrant jobs. Re-entrant jobs require to pass through the processing line multiple times. In many real-life manufacturing systems with parallel machine environments, one of the scheduling problems that needs to be addressed is the order of jobs on each machine with re-entrant jobs. In addition, manufacturing systems may require periodic maintenance, systematic manufacturing equipment cleaning, or predetermined upper limits on the overtime. Therefore, machine availability may vary during the scheduling horizon. We propose an integer programming model to find the optimal sequence of the re-entrant jobs at parallel machines with consideration of machine availability. The model aims to reduce setup times and maximize capacity utilization by scheduling tasks with similar set up requirements consecutively. We tested the proposed model at a panel line manufacturing company located in Turkey. The order of the panels is scheduled optimally by the proposed model for 3 different instances on the identical parallel machines for the coating process. We also provided relevant information on the user interface we developed to make the proposed scheduling model usable to by the company. The proposed model and interphase offer a systematic approach to panel line planning and can also be implemented in other industries. © 2025 Elsevier B.V., All rights reserved.