Ismet Karacan

Mr. Ismet Karacan

ANEL A.S., Istanbul, İstanbul, Turkey (Türkiye)
orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 February 2023 in Processes
Verified
Journal Article
Open access
PDF file
IKIsmet Karacan
Ismet Karacan
Ozlem SenvarOzlem Senvar
Ozlem Senvar
SBSEROL BULKAN
SEROL BULKAN
In this paper, the no-wait flow shop problem with earliness and tardiness objectives is considered. The problem is proven to be NP-hard. Recent no-wait flow shop problem studies focused on familiar objectives, such as makespan, total flow time, and total completion time. However, the problem has limited studies with solution approaches covering the concomitant use of earliness and tardiness objectives. A novel methodology for the parallel simulated annealing algorithm is proposed to solve this problem in order to overcome the runtime drawback of classical simulated annealing and enhance its robustness. The well-known flow shop problem datasets in the literature are utilized for benchmarking the proposed algorithm, along with the classical simulated annealing, variants of tabu search, and particle swarm optimization algorithms. Statistical analyses were performed to compare the runtime and robustness of the algorithms. The results revealed the enhancement of the classical simulated annealing algorithm in terms of time consumption and solution robustness via parallelization. It is also concluded that the proposed algorithm could outperform the benchmark metaheuristics even when run in parallel. The proposed algorithm has a generic structure that can be easily adapted to many combinatorial optimization problems.

19 May 2025 in Processes
Verified
Journal Article
Open access
PDF file
ACAslihan Cubukcuoglu
Aslihan Cubukcuoglu
IKIsmet Karacan
Ismet Karacan
ZCZeynep Ceylan
Zeynep Ceylan
SBSEROL BULKAN
SEROL BULKAN
In this study, the ordered flow shop scheduling problem, which is in the class of NP-hard optimization problems, is considered. This problem is used especially to increase the efficiency and prevent delays in the production process. The problem was first identified in the literature during the 1970s. The main objective of this study is to develop an efficient and fast method to overcome the complexity of this problem. For this purpose, the ordered flow shop scheduling problem is explained in detail and a robust meta-heuristic method is proposed. First of all, a genetic algorithm is developed by considering Smith’s convexity criterion. While performing operations such as crossover and mutation in the genetic algorithm, the pyramid structure is integrated to ensure that the solution has certain symmetry. The developed method is compared with other methods, such as the Nawaz–Enscore–Ham (NEH), pair insert, and iterated local search (ILS) methods. In order to increase the reliability of the results, the Pyramid Structure Adapted Tabu Search (PSA-TS) algorithm is also developed. The results are validated by statistical analysis using the Wilcoxon signed-rank test and Friedman test. The proposed genetic algorithm outperforms the methods with which it is compared. To the best of the authors’ knowledge, there is no other method in the literature that preserves the pyramid structure in the ordered flow shop scheduling problem. Therefore, this study is expected to make a significant contribution to the literature in this respect.

5 June 2021 in Tehnicki vjesnik - Technical Gazette
Verified
Journal Article
Closed access
PDF file
IKIlknur Karacan
Ilknur Karacan
IKIsmet Karacan
Ismet Karacan
Ozlem SenvarOzlem Senvar
Ozlem Senvar
SBSEROL BULKAN
SEROL BULKAN
This study seeks to integrate Random Key Genetic Algorithm (RKGA) and Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) to compute makespan and solve the Flow Shop Scheduling Problem (FSSP). FSSP is considered as...

31 December 2021 in Natural and Applied Sciences Journal
Verified
Journal Article
Closed access
PDF file
IKIsmet Karacan
Ismet Karacan
IEİnanç Erdoğan
İnanç Erdoğan
MIMustafa İğdi̇l
Mustafa İğdi̇l
UCUfuk Cebeci
Ufuk Cebeci
Emerging in the past few decades, Industry 4.0 has wide effects over production lines with an increasing number of novel applications. These applications implement more than one of the tools of Industry 4.0. These tools include but are not limited to internet of things (IoT), big data, cloud computing, artificial intelligence, augmented reality, virtual reality, machine to machine communication (M2M), smart robot applications, etc. The aim of these efforts is mainly to acquire smarter manufacturing systems. With spreading Industry 4.0 methodologies, the role of sensors became more important to respond to new demands. One of the most important sensor types in this sense is the camera which now has wide variants in different forms. Applying machine vision algorithms via cameras grants optimization of many critical processes. In this perspective, the quality of both product and process should be handled as a key performance indicator that may be continuously enhanced for excellence. Machine vision algorithms may be adapted to check and manage quality in designated control points on the production lines. This study focuses on the control of the quality of rotary switches that are widely used in household appliances like ovens and washing machines. Rotary switches are critical components of an appliance since they direct the flow of electricity within the product. A failure in the functionality of this component directly causes the failure of the main product. Hence, the quality rate of rotary switches should be calculated in defective parts per million (dppm) units. An intense quality control procedure is required to achieve low dppm rates during production. As a real-life application, a camera system is integrated into the rotary switch production line on a selected point. Classification algorithms are developed on a cost-effective platform to perform visual quality checks of the rotary switches and qualify as “Ok” or “Defective”. The selected point ensures a high percent check of quality criteria while enabling repair of the defective parts with minor interventions. The aim of this control is to identify a defective rotary switch as soon as possible since most of the defects are irreversible once the rotary switch is totally produced or even some processes are completed. In this case, the entire product should be set apart for scrap. Another originality of our study is applying both Process Failure Mode and Effect Analysis (PFMEA) and Design Failure Mode and Effect Analysis (DFMEA) together. There is almost no referenced study in the literature. Benchmark comparisons are conducted upon completing the integration of the new system to the production line. As a result, enhancements in the quality, cost, and production speed parameters are achieved with a cost-effective smart system. Additional capabilities are added to the system, namely data analyzing online data feeding.

1 January 2019
Verified
Book Chapter
Closed access
IKIlknur Karacan
Ilknur Karacan
IKIsmet Karacan
Ismet Karacan
SBSEROL BULKAN
SEROL BULKAN
Frederick W. Lanchester proposed simple ordinary differential equations that plainly model the attrition of fighting forces in a battlefield. With this insight, researchers studied extensions of these equations to model various battles for years. Novel studies include the application of these equations to miscellaneous field apart from battles that comprise reciprocal contention of opponents. If well-defined, these models can assist decision makers in revealing the shortcomings of a war strategy and discovering the bottlenecks that should be optimized. The recent studies prove that the insights gained from these models can also be utilized in other fields such as economy, biology, engineering, etc. This chapter includes the classic Lanchester equations, significant extensions of classical models, and a number of important application examples.