Kayışoğlu, Betül
Loading...
Profile URL
Name Variants
Betül Kayışoğlu Kayisoglu, Betul Kayışoğlu, Betül
Job Title
Dr. Öğr. Üyesi
Email Address
betul.kayısoglu@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
Google Scholar ID
WoS Researcher ID
No research topics data found.
Sustainable Development Goals
1NO POVERTY
0
Research Products
2ZERO HUNGER
0
Research Products
3GOOD HEALTH AND WELL-BEING
0
Research Products
4QUALITY EDUCATION
0
Research Products
5GENDER EQUALITY
0
Research Products
6CLEAN WATER AND SANITATION
0
Research Products
7AFFORDABLE AND CLEAN ENERGY
0
Research Products
8DECENT WORK AND ECONOMIC GROWTH
0
Research Products
9INDUSTRY, INNOVATION AND INFRASTRUCTURE
1
Research Products
10REDUCED INEQUALITIES
0
Research Products
11SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
12RESPONSIBLE CONSUMPTION AND PRODUCTION
1
Research Products
13CLIMATE ACTION
0
Research Products
14LIFE BELOW WATER
0
Research Products
15LIFE ON LAND
0
Research Products
16PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
17PARTNERSHIPS FOR THE GOALS
0
Research Products
Documents
4
Citations
16
h-index
2
Documents
1
Citations
8
No records found in other affiliations.
Scholarly Output
5
Articles
1
Views / Downloads
68/24
Supervised MSc Theses
0
Supervised PhD Theses
1
WoS Citation Count
8
Scopus Citation Count
16
Patents
0
Projects
0
WoS Citations per Publication
1.60
Scopus Citations per Publication
3.20
Open Access Source
2
Supervised Theses
1
| Journal | Count |
|---|---|
| Eurasia Proceedings of Science, Technology, Engineering and Mathematics | 2 |
| Computers & Operations Research | 1 |
| Eurasia Proceedings of Science, Technology, Engineering and Mathematics -- 7th International Conference on Research in Engineering, Technology and Science, ICRETS 2025 -- 2025-07-10 through 2025-07-13 -- Peja -- 343919 | 1 |
Current Page: 1 / 1
Scopus Quartile Distribution
Competency Cloud
5 results
Scholarly Output Search Results
Now showing 1 - 5 of 5
Conference Object Citation - Scopus: 1Incorporating Worker Heterogeneity in Flexible Flow Shop Environment(ISRES Publishing, 2025-08-15) Ozpacaci, Kubra; Bekli, Seyma; Kayisoglu, BetulWe 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.Article Citation - WoS: 8Citation - Scopus: 13Multiple Allocation Tree of Hubs Location Problem for Non-Complete Networks(Pergamon-Elsevier Science Ltd, 2021-12) Kayisoglu, Betul; Akgun, IbrahimWe study the Multiple Allocation Tree of Hubs Location Problem where a tree topology is required among the hubs and transportation cost of sending flows between OD pairs is minimized. Unlike most studies in the literature that assume a complete network with costs satisfying the triangle inequality to formulate the problem, we define the problem on non-complete networks and develop a modeling approach that does not require any specific cost and network structure. The proposed approach may provide more flexibility in modeling several characteristics of real-life hub networks. Moreover, the approach may produce better solutions than the classical approach, which may result from the differences in the selected hubs, the flow routes between origin-destination points, and the assignment of non-hub nodes to hub nodes. We solve the proposed model using CPLEX-based branch-and-bound algorithm and Gurobi-based branch-and-bound algorithm with Norel heuristic and develop Benders decomposition-based heuristic algorithms using two acceleration strategies, namely, strong cut generation and cut disaggregation. We conduct computational experiments using problem instances defined on non-complete networks with up to 500 nodes. The results indicate that the Benders-type heuristics are especially effective in finding good feasible solutions for large instances.Doctoral Thesis Ağaç Yapılı ve Ayrıt Kapasiteli Hub Yerleşim Problemleri için Model ve Çözüm Metodolojilerinin Geliştirilmesi(Abdullah Gül Üniversitesi Fen Bilimleri Enstitüsü, 2022) Kayışoğlu, Betül; Kayışoğlu, Betül; Akgün, İbrahimIn this dissertation, we study two different extensions to hub location problems, namely, Multiple Allocation Tree of Hubs Location Problem (MATHLP) that result from incorporating a tree topology requirement for the hub network and Multiple Allocation Arc Capacitated Hub Location Problem (MACHLP) that result from imposing capacities on the arcs. We consider both problems in a multiple allocation framework and try to minimize total flow cost by locating p hubs. Unlike most studies in the literature that use complete networks with costs satisfying the triangle inequality to formulate the problems, we define the problems on non-complete networks and develop a modeling approach that does not require any specific cost and network structure. Our proposed approach provides more flexibility in modeling several characteristics of real-life hub networks. We solve the proposed models using CPLEX-based algorithm and Gurobi-based algorithm with NoRel heuristic. For MATHLP, we develop Benders decomposition-based heuristic algorithms and for MACHLP, we develop a heuristic algorithm based on simulated annealing. We conduct computational experiments using problem instances defined on non-complete networks with up to 500 and 400 nodes for MATHLP and MACHLP respectively. The results indicate that the proposed solution methodologies are especially effective in finding good feasible solutions for large instances. Keywords: hub location problem, tree of hubs location problem, arc capacitated hub location problem, benders-type heuristics, simulated annealingConference Object Scheduling in Flexible Flow Shop Environments with Re-Entrant Jobs and Heterogeneous Workers(ISRES Publishing, 2025-10-27) Bekli, S.; Kayisoglu, B.In many industries, manufacturing is organized as a flexible flow shop (FFS), which has gotten the researchers' attention. The scheduling studies, particularly those on FFS scheduling, are concerned with homogeneous workers with the same skill set or heterogeneous workers who can only perform one specific type of operation on the production lines. Moreover, jobs are mainly assumed to go through an operation once. Yet, in real-life production, workers might have different skill sets with varying processing times. Furthermore, certain jobs may require revisiting the same machine multiple times, i.e., re-entrant jobs. We study an FFS environment with re-entrant jobs, considering worker flexibility. We propose a mixed integer linear programming model to find the optimal sequences of jobs to be processed by the multiskilled workers assigned to the production system, ensuring each re-entrant job waits for a predefined time window before reprocessing on the same operation. The objective of the model is to minimize makespan. We tested the proposed model on a dataset taken from a real production system of a PVC windows and doors production facility. © 2025 Published by ISRES Publishing.Conference Object Citation - Scopus: 2Parallel Machine Scheduling With Re-Entrant Jobs With Consideration of Set Up Times(ISRES Publishing, 2024-12-30) Kayisoglu, Betul; Bekli, Seyma; Sahin, Ayse Sena; Akyurek, Gamze Gul; Aydinli, Ruveyda; Copur, Sevda Nur; Ekinci, TugbaWe 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.