Bilgilendirme: Kurulum ve veri kapsamındaki çalışmalar devam etmektedir. Göstereceğiniz anlayış için teşekkür ederiz.
 

Çetinkaya, Ferda Can

Profile Picture
Profile URL
https://hdl.handle.net/20.500.12416/8758
Name Variants
Çetinkaya, F.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
Status
Current Staff
Website
ie.cankaya.edu.tr/faculty_fccetinkaya_en.php
ORCID ID
0000-0001-7698-2782
Scopus Author ID
24754565700
Turkish CoHE Profile ID
50129
Google Scholar ID
j5WbxvIAAAAJ
WoS Researcher ID
HT-6005-2023
Files
00660.jpeg (3.08 KB)

Sustainable Development Goals

13

CLIMATE ACTION
CLIMATE ACTION Logo

0

Research Products

8

DECENT WORK AND ECONOMIC GROWTH
DECENT WORK AND ECONOMIC GROWTH Logo

0

Research Products

3

GOOD HEALTH AND WELL-BEING
GOOD HEALTH AND WELL-BEING Logo

0

Research Products

15

LIFE ON LAND
LIFE ON LAND Logo

0

Research Products

17

PARTNERSHIPS FOR THE GOALS
PARTNERSHIPS FOR THE GOALS Logo

0

Research Products

14

LIFE BELOW WATER
LIFE BELOW WATER Logo

0

Research Products

4

QUALITY EDUCATION
QUALITY EDUCATION Logo

0

Research Products

11

SUSTAINABLE CITIES AND COMMUNITIES
SUSTAINABLE CITIES AND COMMUNITIES Logo

0

Research Products

6

CLEAN WATER AND SANITATION
CLEAN WATER AND SANITATION Logo

0

Research Products

10

REDUCED INEQUALITIES
REDUCED INEQUALITIES Logo

0

Research Products

9

INDUSTRY, INNOVATION AND INFRASTRUCTURE
INDUSTRY, INNOVATION AND INFRASTRUCTURE Logo

1

Research Products

12

RESPONSIBLE CONSUMPTION AND PRODUCTION
RESPONSIBLE CONSUMPTION AND PRODUCTION Logo

0

Research Products

2

ZERO HUNGER
ZERO HUNGER Logo

0

Research Products

1

NO POVERTY
NO POVERTY Logo

0

Research Products

7

AFFORDABLE AND CLEAN ENERGY
AFFORDABLE AND CLEAN ENERGY Logo

0

Research Products

5

GENDER EQUALITY
GENDER EQUALITY Logo

0

Research Products

16

PEACE, JUSTICE AND STRONG INSTITUTIONS
PEACE, JUSTICE AND STRONG INSTITUTIONS Logo

0

Research Products
Documents

13

Citations

158

h-index

6

Go to Scopus profile
Documents

0

Citations

0

Go to WoS profile
Scholarly Output

13

Articles

10

Views / Downloads

694/28

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

30

Scopus Citation Count

50

WoS h-index

4

Scopus h-index

5

Patents

0

Projects

0

WoS Citations per Publication

2.31

Scopus Citations per Publication

3.85

Open Access Source

5

Supervised Theses

0

Google Analytics Visitor Traffic

JournalCount
European J. of Industrial Engineering3
İngilizce Türkçe Endüstri mühendisliği ve mühendislik terimleri sözlüğü1
International Journal of Industrial Engineering and Management1
International Journal of Industrial Engineering and Production Research1
International Journal of Industrial Engineering Computations1
Current Page: 1 / 3

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 10 of 13
  • Thumbnail Image
    Article
    Citation - WoS: 3
    Citation - Scopus: 6
    Lot 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.
  • Thumbnail Image
    Article
    Citation - WoS: 4
    Citation - Scopus: 10
    Customer 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 Can
    This 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
  • Thumbnail Image
    Article
    Citation - WoS: 2
    Citation - Scopus: 3
    Single-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.
  • Thumbnail Image
    Article
    Citation - WoS: 4
    Citation - Scopus: 4
    Unrelated 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.
  • Thumbnail Image
    Article
    Citation - Scopus: 3
    Customer 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.
  • Thumbnail Image
    Conference Object
  • Thumbnail Image
    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, Meral
    This 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.
  • Thumbnail Image
    Book
  • Thumbnail Image
    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
  • Thumbnail Image
    Article
    Citation - WoS: 5
    Citation - Scopus: 8
    Lp Relaxation-Based Solution Algorithms for the Multi-Mode Project Scheduling With a Non-Renewable Resource
    (inderscience Enterprises Ltd, 2015) Cetinkaya, Ferda Can; Pamir, Selin Kirbiyik; Azizoglu, Meral
    In this study, we consider a multi-mode resource allocation problem with a single non-renewable resource. We assume the resource is released at defined time points and at defined quantities. We also assume that the activity costs are charged once they are completed. Our aim is to minimise the project completion time. We formulate the problem as a pure integer programming model and show that it is strongly NP-hard. We find lower bounds by pure and mixed integer linear programming relaxations of the model and develop three heuristic procedures based on those relaxations. The results of our computational study have revealed the satisfactory performances of our lower bounds and heuristic procedures.