Çetinkaya, Ferda Can
Loading...
Profile URL
Name Variants
Çetinkaya, F.C.
Cetinkaya, F. C.
Cetinkaya, Ferda Can
Cetinkaya, Ferda C.
Cetinkaya, F. C.
Cetinkaya, Ferda Can
Cetinkaya, Ferda C.
Job Title
Prof. Dr.
Email Address
cetinkaya@cankaya.edu.tr
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
Current Staff
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Files
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
Documents
13
Citations
160
h-index
6
Documents
0
Citations
0
Scholarly Output
14
Articles
11
Views / Downloads
700/36
Supervised MSc Theses
0
Supervised PhD Theses
0
WoS Citation Count
31
Scopus Citation Count
52
Patents
0
Projects
0
WoS Citations per Publication
2.21
Scopus Citations per Publication
3.71
Open Access Source
6
Supervised Theses
0
| Journal | Count |
|---|---|
| European J. of Industrial Engineering | 3 |
| Decision Science Letters | 2 |
| International Journal of Industrial Engineering and Management | 1 |
| International Journal of Industrial Engineering and Production Research | 1 |
| International Journal of Industrial Engineering Computations | 1 |
Current Page: 1 / 3
Scopus Quartile Distribution
Competency Cloud
14 results
Scholarly Output Search Results
Now showing 1 - 10 of 14
Article Citation - Scopus: 4Customer Order Scheduling With Job - Based Processing and Lot Streaming in a Two - Machine Flow Shop(Iran University of Science and Technology, 2022) Çetinkaya, F.C.; Yozgat, G.B.This study introduces a new variant of the customer order scheduling (COS) problem in which each customer orders several products processed in a two-machine flow shop. Customers' orders are satisfied by the job-based processing approach in which the same products ordered by different customers form a product lot (job). Each customer's order for a product is processed as a sublot (batch) of identical products processed together by the same machine without intermingling the sublots of other products. A sequence-independent attached setup on each machine is required before starting the process of a product lot. Each customer order is delivered in a single shipment when processing all products in that customer order is finished. The aim is to construct an optimal schedule of product lots and the sublots' sequence in every job lot by minimizing the sum of completion times of the customer orders. In our study, a mixed-integer linear programming (MILP) model and a multi-phase heuristic algorithm are developed for solving the problem. The computational experiments reveal that the proposed model solves the small-scale problem instances with and without setups optimally within three hours of a run-time limit. However, our proposed algorithm finds optimal or near-optimal solutions for the medium and large-scale problem instances in less than five seconds. © 2022 Iran University of Science and Technology. All rights reserved.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, MeralBook İngilizce Türkçe Endüstri mühendisliği ve mühendislik terimleri sözlüğü(TMMOB, 2009) Çetinkaya, Ferda CanConference Object Sector Selection for Cluster Formation at OSTİM Industrial Zone: An AHP Application(2009) Çetinkaya, Ferda Can; Kandiller, Levent; Satır, Benhür; Umutlu, MehmetArticle Citation - WoS: 4Citation - Scopus: 10Customer Order Scheduling With Job-Based Processing on a Single-Machine To Minimize the Total Completion Time(Growing Science, 2021) Yeloglu, Pinar; Catmakas, Hale Akkocaoglu; Cetinkaya, Ferda CanThis study considers a customer order scheduling (COS) problem in which each customer requests a variety of products (jobs) processed on a single flexible machine, such as the computer numerical control (CNC) machine. A sequence-independent setup for the machine is needed before processing each product. All products in a customer order are delivered to the customer when they are processed. The product ordered by a customer and completed as the last product in the order defines the customer order's completion time. We aim to find the optimal schedule of the customer orders and the products to minimize the customer orders' total completion time. We have studied this customer order scheduling problem with a job-based processing approach in which the same products from different customer orders form a product lot and are processed successively without being intermingled with other products. We have developed two mixed-integer linear programming models capable of solving the small and medium-sized problem instances optimally and a heuristic algorithm for large-sized problem instances. Our empirical study results show that our proposed tabu search algorithm provides optimal or near-optimal solutions in a very short time. We have also compared the job-based and order-based processing approaches for both setup and no-setup cases and observed that the job-based processing approach yields better results when jobs have setup times. (C) 2021 by the authors; licensee Growing Science, CanadaArticle Citation - WoS: 2Citation - Scopus: 3Single-Machine Scheduling of Indivisible Multi-Operation Jobs(Southern African inst industrial Engineering, 2019) Gorur, A. K.; Cetinkaya, F. C.; Catmakas, H. A.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.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.Article 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 Citation - WoS: 3Citation - Scopus: 6Lot Streaming in a Two-Machine Mixed Shop(Springer London Ltd, 2010) Duman, Mehmet; Cetinkaya, Ferda C.Most classical scheduling models overlook the fact that products are often produced in job lots and assume that job lots are indivisible single entities, although an entire job lot consists of many identical items. However, splitting an entire lot (process batch) into sublots (transfer batches) to be moved to downstream machines allows the overlapping of different operations on the same product while work needs to be completed on the upstream machine. This approach is known as lot streaming in scheduling theory. In this study, the lot streaming problem of multiple jobs in a two-machine mixed shop where there are two different job types as flow shop and open shop is addressed so as to minimize the makespan. The optimal solution method is developed for the mixed shop scheduling problem in which lot streaming can improve the makespan.Conference Object İmalat kafilesi bölme ve aktarma problemleri üzerine literatür taraması ve potansiyel araştırma konuları(2008) Çetinkaya, Ferda Can
