Çetinkaya, Ferda Can
Loading...
Name Variants
Job Title
Prof. Dr.
Email Address
cetinkaya@cankaya.edu.tr
Main Affiliation
Endüstri Mühendisliği
Status
Current Staff
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Files
Sustainable Development Goals Report Points
SDG data could not be loaded because of an error. Please refresh the page or try again later.
Scholarly Output
11
Articles
16
Citation Count
38
Supervised Theses
0
11 results
Scholarly Output Search Results
Now showing 1 - 10 of 11
Article Citation - WoS: 6Citation - Scopus: 6Solution approaches to the blood distribution problem of the Turkish Red Crescent(inderscience Enterprises Ltd, 2018) Kurt, Atıl; Kurt, Atil; Azizoglu, Meral; Çetinkaya, Ferda Can; Cetinkaya, Ferda Can; 21650; 5546; 50129; Endüstri MühendisliğiThis 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.Conference Object İmalat kafilesi bölme ve aktarma problemleri üzerine literatür taraması ve potansiyel araştırma konuları(2008) Çetinkaya, Ferda Can; 50129; Endüstri MühendisliğiArticle Citation - Scopus: 3Scheduling With Lot Streaming In A Two-Machine Re-Entrant Flow Shop(Regional Association for Security and crisis management, 2021) Çetinkaya, F.C.; Çetinkaya, Ferda Can; Duman, M.; 50129; Endüstri MühendisliğiLot streaming is splitting a job-lot of identical items into several sublots (portions of a lot) that can be moved to the next machines upon completion so that operations on successive machines can be overlapped; hence, the overall performance of a multi-stage manufacturing environment can be improved. In this study, we consider a scheduling problem with lot streaming in a two-machine re-entrant flow shop in which each job-lot is processed first on Machine 1, then goes to Machine 2 for its second operation before it returns to the primary machine (either Machine 1 or Machine 2) for the third operation. For the two cases of the primary machine, both single-job and multi-job cases are studied independently. Optimal and near-optimal solution procedures are developed. Our objective is to minimize the makespan, which is the maximum completion time of the sublots and job lots in the single-job and multi-job cases, respectively. We prove that the single-job problem is optimally solved in polynomial-time regardless of whether the third operation is performed on Machine 1 or Machine 2. The multi-job problem is also optimally solvable in polynomial time when the third operation is performed on Machine 2. However, we prove that the multi-job problem is NP-hard when the third operation is performed on Machine 1. A global lower bound on the makespan and a simple heuristic algorithm are developed. Our computational experiment results reveal that our proposed heuristic algorithm provides optimal or near-optimal solutions in a very short time. © 2021 by the authors. Submitted for possible open access publication under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).Conference 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, Mehmet; 50129; Endüstri Mühendisliği; İşletmeArticle Citation - WoS: 2Citation - Scopus: 3Single-Machine Scheduling of Indivisible Multi-Operatıon Jobs(Southern African inst industrial Engineering, 2019) Çetinkaya, Ferda Can; Cetinkaya, F. C.; Catmakas, H. A.; Görür, Abdül Kadir; Gorur, A. K.; 50129; 57532; 107251; Endüstri Mühendisliği; Bilgisayar MühendisliğiThis 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.Book İngilizce Türkçe Endüstri mühendisliği ve mühendislik terimleri sözlüğü(TMMOB, 2009) Çetinkaya, Ferda Can; 50129; Endüstri MühendisliğiArticle Citation - WoS: 0Citation - Scopus: 0An integrated inventory and distribution planning problem for the blood products: An application for the Turkish Red Crescent(Growing Science, 2023) Kurt, Atıl; Kurt, Atil; Azizoglu, Meral; Çetinkaya, Ferda Can; Cetinkaya, Ferda Can; 50129; Endüstri MühendisliğiThis 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.Article Citation - WoS: 3Citation - Scopus: 5Lot Streaming In A Two-Machine Mixed Shop(Springer London Ltd, 2010) Cetinkaya, Ferda C.; Çetinkaya, Ferda Can; Duman, Mehmet; 50129; Endüstri MühendisliğiMost 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.Article Citation - WoS: 5Citation - Scopus: 5A blood distribution problem with new transportation options - an application for the Turkish Red Crescent(inderscience Enterprises Ltd, 2019) Kurt, Atıl; Kurt, Atil; Cetinkaya, Ferda Can; Çetinkaya, Ferda Can; Azizoglu, Meral; 50129; Endüstri MühendisliğiThis 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: 9Customer order scheduling with job-based processing on a single-machine to minimize the total completion time(Growing Science, 2021) Cetinkaya, Ferda Can; Çetinkaya, Ferda Can; Yeloglu, Pinar; Catmakas, Hale Akkocaoglu; 50129; Endüstri MühendisliğiThis 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, Canada
