Kurt, Atıl
Loading...
Profile URL
Name Variants
Kurt, A. & Kurt, Atil
Job Title
Öğr. Gör.
Email Address
Main Affiliation
06.04. Endüstri Mühendisliği
Endüstri Mühendisliği
06. Mühendislik Fakültesi
01. Çankaya Üniversitesi
Endüstri Mühendisliği
06. Mühendislik Fakültesi
01. Çankaya Üniversitesi
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
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
0
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
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
No records found in other affiliations.
Scholarly Output
8
Articles
7
Views / Downloads
836/1092
Supervised MSc Theses
1
Supervised PhD Theses
0
WoS Citation Count
62
Scopus Citation Count
70
Patents
0
Projects
0
WoS Citations per Publication
7.75
Scopus Citations per Publication
8.75
Open Access Source
5
Supervised Theses
1
| Journal | Count |
|---|---|
| Decision Science Letters | 2 |
| European J. of Industrial Engineering | 2 |
| Asia Pacific Journal of Mathematics | 1 |
| International Journal of Industrial Engineering and Management | 1 |
| Optical and Quantum Electronics | 1 |
Current Page: 1 / 1
Scopus Quartile Distribution
Competency Cloud
8 results
Scholarly Output Search Results
Now showing 1 - 8 of 8
Article Citation - WoS: 45Citation - Scopus: 52New Solutions for Conformable Fractional Nizhnik-Novikov System Via G'/g Expansion Method and Homotopy Analysis Methods(Springer, 2017) Tasbozan, O.; Baleanu, D.; Kurt, A.The main purpose of this paper is to find the exact and approximate analytical solution of Nizhnik-Novikov-Veselov system which may be considered as a model for an incompressible fluid with newly defined conformable derivative by using G'/G expansion method and homotopy analysis method (HAM) respectively. Authors used conformable derivative because of its applicability and lucidity. It is known that, the NNV system of equations is an isotropic Lax integrable extension of the well-known KdV equation and has physical significance. Also, NNV system of equations can be derived from the inner parameter-dependent symmetry constraint of the KP equation. Then the exact solutions obtained by using G'/G expansion method are compared with the approximate analytical solutions attained by employing HAM.Article Citation - WoS: 7Citation - Scopus: 7Solution Approaches To the Blood Distribution Problem of the Turkish Red Crescent(inderscience Enterprises Ltd, 2018) Cetinkaya, Ferda Can; Kurt, Atil; Azizoglu, MeralThis paper considers the blood distribution problem that includes irradiation centres, urgent demands, and product availability in Turkey, Central Anatolian Regional Blood Center of the Turkish Red Crescent. To address the problem, we develop a mixed integer linear program with two objectives: maximising the demand satisfaction and minimising total time travelled by the vehicles. We propose two decomposition-based heuristic solution approaches. The results of our experiments have revealed that the model cannot solve even small sized instances in reasonable times; however, the heuristic solution approaches are appropriate for solving complex real life problems.Master Thesis Unrelated parallel machines scheduling under machine availability and eligibility constraints(2012) Kurt, AtılIn the literature of the parallel machines scheduling, it is generally assumed that all machines are continuously available for processing jobs and each job can be processed by any machine. However, these assumptions become unrealistic in some industrial environments. In this study, we consider the problem of scheduling n independent jobs on m unrelated parallel machines subject to machine availability and eligibility constraints, given the maximum continuous working time before the maintenance of each machine and the maintenance time. Our objective is to minimize the makespan, which is the time to complete the processing of all jobs. We consider both resumable and non-resumable jobs, and develop mathematical models and heuristic algorithm that obtain exact and near-optimal solutions, respectively, for both cases with multiple machine unavailability periods. Computational experiments are done to evaluate the performance of our solution methods in terms of both quality and time. The results show that the proposed heuristic algorithm finds near-optimal solutions in very short timeArticle Citation - Scopus: 1Analytical and Numerical Solutions for Time-Fractional New Coupled Mkdv Equation Arising in Interaction of Two Long Waves(Asia Pacific Academic, 2019) Şenol, M.; Kurt, A.; Baleanu, D.; Tasbozan, O.The aim of this paper is to present new exact solution sets of nonlinear conformable time-fractional new coupled mKdV equations which arise in interaction of two long waves with different dispersion relations by means of sub-equation method. In addition, we also propose an analytical-approximate method namely residual power series method (RPSM) for the system. The fractional derivatives have been explained in newly defined conformable type, during the solution procedure. The exact solutions of the system obtained by the sub-equation method have been compared to approximate solutions derived by RPSM. The results showed that both methods are robust, dependable, easy to apply and a good alternative for seeking solutions of fractional partial differential equations. © 2019 Asia Pacific Journal of Mathematics.Article Citation - WoS: 5Citation - Scopus: 5Unrelated Parallel Machine Scheduling Under Machine Availability and Eligibility Constraints To Minimize the Makespan of Non-Resumable Jobs(Univ Novi Sad, Fac Technical Sciences, 2024) Kurt, A.; Cetinkaya, F. C.This study considers the scheduling problem of multiple independent and non-resumable jobs on unrelated parallel machines subject to machine availability and eligibility constraints. For each machine, there is a maximum continuous working time due to an unavailable period required for maintenance or tool changeover so that multiple unavailable periods on each machine may occur. The start time of an unavailable period on each machine is flexible and depends on the sum of the processing times of all jobs completed before this unavailability period. The objective is to minimize the makespan, which is the time to complete the processing of all non-resumable jobs. We develop a mixed integer linear programming (MILP) model to solve the problem optimally and a heuristic algorithm to solve the problem instances for which the MILP model cannot achieve an optimal solution in a reasonable allowed solution time. Computational experiments are done to evaluate our solution approaches' performance in terms of quality and time. The results show that using a mixed integer linear programming model is not a practical alternative, especially for large -sized problem instances. However, the proposed heuristic algorithm finds near -optimal solutions in a very short time.Article An Integrated Inventory and Distribution Planning Problem for the Blood Products: An Application for the Turkish Red Crescent(Growing Science, 2023) Çetinkaya, Ferda Can; Kurt, Atıl; Azizoğlu, MeralArticle Citation - WoS: 5Citation - Scopus: 5A Blood Distribution Problem With New Transportation Options - an Application for the Turkish Red Crescent(inderscience Enterprises Ltd, 2019) Azizoglu, Meral; Kurt, Atil; Cetinkaya, Ferda CanThis paper considers the blood distribution problem in the Central Anatolian Regional Blood Centre of the Turkish Red Crescent (TRC) and proposes several demand satisfaction options considering the irradiation centres, urgent demands, and product availability. Our aim is to maximise the total weighted blood demand satisfaction. To address the problem, we develop a mixed integer linear programming model and propose a hybrid genetic algorithm (HGA). The results of our experiments have revealed that the mathematical model cannot handle even small sized problem instances in reasonable times; however, the hybrid genetic algorithm is capable of handling complex daily operations of the Turkish Red Crescent.Article An Integrated Inventory and Distribution Planning Problem for the Blood Products: An Application for the Turkish Red Crescent(Growing Science, 2023) Cetinkaya, Ferda Can; Kurt, Atil; Azizoglu, MeralThis study considers an integrated inventory planning and distribution problem based on an applied case at the Turkish Red Crescent's Central Anatolian Regional Blood Center. We define two echelons, the first echelon being the regional blood center and the second echelon being the districts. The blood products are perishable so that the outdated products are disposed of at the end of their lives. We aim to minimize the cost of inventory keeping at both echelons, the shortage, and disposal amounts at the second echelon. We consider two distribution strategies: all deliveries are realized by the regional blood center (current implementation), and the deliveries are directly from the regional blood center or the other districts. We develop a mixed -integer linear programming model for each strategy. Our experimental results show that the decentralized strategy brings significant cost reductions over the centralized strategy. The mathematical model for the centralized distribution strategy can handle large-sized instances. On the other hand, the model for the decentralized distribution strategy is more complex and could not handle large-sized instances in our pre-specified termination limit of two hours. For large -sized instances of the decentralized distribution strategy, we design a decomposition-based heuristic algorithm that benefits from the optimal solutions of the original model and finds near -optimal solutions very quickly. (c) 2023 by the authors; licensee Growing Science, Canada.