Yüksel, Damla

Profile Picture
Profile URL
https://gcris.yasar.edu.tr/handle/123456789/12739
Name Variants
Job Title
Araş.Gör.
Email Address
Main Affiliation
01.01.09.03. Endüstri Mühendisliği Bölümü
Status
Former Staff
Website
ORCID ID
Scopus Author ID
57212210455
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
ABE-9888-2020

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
0
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
0
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
2
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
1
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
0
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
3
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
4
Research Products
CLIMATE ACTION13
CLIMATE ACTION
1
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
1
Research Products
LIFE ON LAND15
LIFE ON LAND
1
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS FOR THE GOALS
1
Research Products
Documents

17

Citations

185

h-index

6

Go to Scopus profile
Documents

13

Citations

157

Go to WoS profile
Scholarly Output

17

Articles

5

Views / Downloads

0/0

Supervised MSc Theses

1

Supervised PhD Theses

1

WoS Citation Count

153

Scopus Citation Count

180

Patents

0

Projects

0

WoS Citations per Publication

9.00

Scopus Citations per Publication

10.59

Open Access Source

3

Supervised Theses

2

JournalCount
21st International Symposium on Production Research (ISPR) - Digitizing Production System3
19th International Symposium for Production Research ISPR 20192
25th International Conference on Production Research Manufacturing Innovation (ICPR) - Cyber Physical Manufacturing1
Annals of Operations Research1
Computers & Industrial Engineering1
Current Page: 1 / 3

Scopus Quartile Distribution

Quartile distribution chart data is not available

Competency Cloud

GCRIS Competency Cloud

Scholarly Output Search Results

Now showing 1 - 10 of 17
  • Thumbnail Image
    Conference Object
    Citation - WoS: 2
    Citation - Scopus: 2
    Parallel Workforce Assignment Problem for Battery Production
    (SPRINGER-VERLAG SINGAPORE PTE LTD, 2022) Aslihan Erdosan; Aysenur Tali; Berfu Kircali; Buket Gunal; Ecem Nazli Dedecengiz; Damla Yuksel; Banu Yetkin Ekren; Yüksel, Damla; Erdosan, Aslihan; Günal, Buket; Dedecengiz, Ecem Nazlı; Ekren, Banu Yetkin; Erdoğan, Aslıhan; Talı, Ayşenur; Kırcalı, Berfu; NM Durakbasa; MG Gencyilmaz
    This paper studies workforce assignment problem for battery production in a company in Turkey. Several types of batteries are produced in the studied company. Mostly the operations are semi-automated. In the production process the workers are assigned to multiple operations irregularly based on the priority of productions. In the company average utilization of worker is low and average cycle time of a product is high due to inefficient allocation of the workforce within the operations. In order to analyze the main system problem we simulate the system and observe the queue lengths to identify the bottlenecks. By dynamic assignment of workers at stations based on real time queue conditions the workloads can be balanced throughout the production lines. In this project a simulation-based system improvement is completed by applying: (i) dynamic utilization of workforce to reduce average cycle time of a battery (ii) assignment of parallel workforce where they can work for the same operation simultaneously and (iii) observation of real-time queue lengths of stations. Three dynamic assignment policies are developed and compared with each other. The best policy providing minimum cycle time for a battery production is selected to be the best.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 8
    Citation - Scopus: 11
    A Discrete Artificial Bee Colony Algorithm for the Energy-Efficient No-Wait Flowshop Scheduling Problem
    (ELSEVIER SCIENCE BV, 2019) M. Fatih Tasgetiren; Damla Yuksel; Liang Gao; Quan-Ke Pan; Peigen Li; Yuksel, Damla; Tasgetiren, M. Fatih; Gao, Liang; Li, Peigen; Fatih Tasgetiren, M.; Pan, Quan-Ke; CH Dagli; GA Suer
    No-wait permutation flow shop scheduling problem (NWPFSP) is a variant of permutation flow shop scheduling problem (PFSP) where the processing of each job must be continuous from start to end without any interruption. That is once a job starts its processing it has to be processed until the last machine without any interruption. The aim of this study is to propose an energy-efficient NWPFSP for the determination of a trade-off between total flow time and total energy consumption by obtaining the Pareto optimal set that is the non-dominated solution set. A bi-objective mixed-integer programming model is developed where the machines can operate at different speed levels. Since the problem is NP-complete an energy-efficient discrete artificial bee colony (DABC) and an energy-efficient genetic algorithm (MOGA) also a variant of this algorithm (MOGALS) are developed as heuristic methods. First the performance of these algorithms for comparison with the mathematical model is represented in small size instances in the scope of cardinality and quality of the non-dominated solutions then it is shown that DABC performs better than two other algorithms in larger instances. (C) 2019 The Authors. Published by Elsevier Ltd.
  • Thumbnail Image
    Article
    Citation - WoS: 35
    Citation - Scopus: 25
    A circular food supply chain network model to reduce food waste
    (Springer, 2022) Ozgur Kabadurmus; Yigit Kazancoglu; Damla Yüksel; Melisa Ozbiltekin-Pala; Yüksel, Damla; Pala, Melisa Özbiltekin; Kabadurmus, Ozgur; Kazançoğlu, Yiğit
    Food loss and waste (FLW) is a growing global problem throughout the world. The rapid increase in food waste and deficiencies in treatment processes have led to greater harm to the environment. A circular food supply chain (FSC) is now an essential means of encouraging circular economy. Proper food waste treatment and recycling operations can not only benefit the environment but these wastes can also be used as raw material for production in a circular economy. In this study a circular food supply chain network model is designed to reduce the food waste generated in the circular food supply chain systems of municipalities. Then a mixed-integer linear programming model is generated to model the proposed circular food supply chain network model. The MILP model is a network model aimed at reducing the food waste generated. To do so two objectives are considered: the overall cost of the network is minimized and the amount of distributed food waste from the generation nodes to the end nodes is maximized. Due to the bi-objective nature of the proposed mathematical model the Improved Augmented Epsilon Constraint method (AUGMECON2) is implemented to solve the problem optimally. To illustrate the applicability and effectiveness of the proposed mathematical model two real-life case studies were carried out in Izmir the third largest city in Turkey. The computational results demonstrate that the proposed model is beneficial for both small and large municipalities since it provides the Pareto-optimal set where the total amount of distributed food waste is maximized and the total cost is minimized. © 2022 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Water Resource Management Using a Multiperiod Water Pricing Model in Izmir District
    (SPRINGER-VERLAG SINGAPORE PTE LTD, 2022) Zeynep Irem Ozen; Berk Sadettin Tengerlek; Damla Yuksel; Efthymia Staiou; Levent Kandiller; Yüksel, Damla; Özen, Zeynep İrem; Tengerlek, Berk Sadettin; Staiou, Efthymia; Kandiller, Levent; NM Durakbasa; MG Gencyilmaz
    Water is a product that cannot be substituted for living creatures to survive. The availability of water resources is crucial. The balance of water availability can change with environmental factors and as a result living creatures struggle with water scarcity. This study includes the policy of water pricing in the Izmir district. A multiperiod water pricing model based on transportation and inventory carrying problems is developed for encouraging water consumption reduction. Different pricing policy scenarios are proposed using the developed model to provide sustainable water management and penalize high water use. The aim is to maximize consumer welfare and ensure fair distribution among groups.
  • Thumbnail Image
    Article
    Citation - WoS: 15
    Citation - Scopus: 14
    Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops
    (ELSEVIER, 2024) Damla Yuksel; Levent Kandiller; Mehmet Fatih Tasgetiren; Yüksel, Damla; Taşgetiren, Mehmet Fatih; Kandiller, Levent
    Combining Deep Reinforcement Learning and meta-heuristic techniques represents a new research direction for enhancing the search capabilities of meta-heuristic methods in the context of production scheduling. Q-learning is a prominent reinforcement learning in which its utilization aims to direct the selection of actions thus preventing the necessity for a random exploration in the iterative process of the metaheuristics. In this study we provide Q-learning guided algorithms for the Bi-Criteria No-Wait Flowshop Scheduling Problem (NWFSP). The problem is treated as a bi-criteria combinatorial optimization problem where total flow time and makespan are optimized simultaneously. Firstly a deterministic mixed-integer linear programming (MILP) model is provided. Then Q-learning guided algorithms are developed: Bi-Criteria Iterated Greedy Algorithm with Q-Learning (BCIGQL). Bi-Criteria Block Insertion Heuristic Algorithm with Q-Learning (BC-BIHQL). Moreover the performance of the proposed Q-learning guided algorithms is compared over a collection of Bi-Criteria Genetic Local Search Algorithms (BC-GLS) Bi-Criteria Iterated Greedy Algorithm (BC-IG) Bi-Criteria Iterated Greedy Algorithm with a Local Search (BC-IGALL) and Bi-Criteria Variable Block Insertion Heuristic Algorithm (BC-VBIH). The complete computational experiment performed on 480 problem instances of Vallada et al. (2015) which is known as the VRF benchmark set indicates that the BC-BIHQL and the BC-IGQL algorithms outperform the BC-GLS BC-IG BCIGALL and BC-VBIH algorithms in comparative performance metrics. More specifically the proposed BC-BIHQL and BC-IGQL algorithms can yield more non-dominated bi-criteria solutions with the most substantial competitiveness than the remaining algorithms. At the same time both are competitive with each other on the benchmark problems. Moreover the BC-IGQL algorithm dominates almost 97% and 99% of the solutions reached by the BC-IG BC-IGALL and BC-VBIH algorithms in small and large datasets. Similarly The BC-BIHQL algorithm dominates almost 98% and 99% of the solutions reached by the BC-IG BC-IGALL and BC-VBIH algorithms in small and large datasets respectively. This means that among all the features that have been compared the Qlearning-guided algorithms demonstrate the highest level of competitiveness. The outcomes of this study encourage us to discover many more bi-criteria NWFSPs to reveal the trade-off between other conflicting objectives such as makespan & the number of early jobs to overcome various industries' problems.
  • Thumbnail Image
    Article
    Süt Sevkiyat Problemi için Matematiksel Modeller
    (2021) Sinem Özkan; Damla Kizilay; Hande Öztop; DAMLA YÜKSEL; Yüksel, Damla; Kizilay, Damla; Özkan, Sinem; Öztop, Hande
    Bu çalışma küçük ölçekli bir dağıtım şirketi için şişelenmiş süt sevkiyat problemini ele almaktadır. Şişelenmiş süt sevkiyat problemi ile birçok gerçek\rhayat uygulamasında karşılaşabilmektedir. Sosyal sorumluluk projesi kapsamında şirketler ve belediyeler dahil olmak üzere birçok organizasyon \rçocuklar için ilkokullara ve yoksul ailelere ücretsiz olarak süt dağıtmaktadır. Bu şirketler genellikle belli bir kapasiteye sahip araçlar kullanarak ve\rmüşterilerin (okullar ve aileler) uygun oldukları saat aralıklarını dikkate alarak dağıtım yapmaktadır. Planlama sürecinde genellikle akaryakıt ve\rdepolama maliyetleri gibi masraflar en aza indirilmek istenmektedir. Bu kısıtlar altında problemin teslim zaman aralığı ve araç kapasitesi kısıtlı\raraç rotalama problemi (CVRPTW) olduğu ortaya çıkmaktadır. Temel hedeflerden biri araçların yakıt tüketimini azaltmak için araç türünü dikkate\ralarak toplam seyahat mesafesini en aza indirmektir. Diğer bir amaç ise zamanında teslim edilemeyen sütlerin depolama maliyetini azaltmak için \rmüşterilere uygun zaman aralıklarına göre hizmet vermek ve geç ürün teslimlerini azaltmaktır. Bu hedeflere ulaşmak amacıyla probleme özgü\rkarmaşık tam sayılı doğrusal programlama (MILP) ve kısıt programlama (CP) modelleri geliştirilmiştir. Matematiksel modelleri doğrulamak ve\rkarşılaştırmak için literatürde oldukça bilinen veri setleri üzerinde probleme özgü parametreler dikkate alınarak bazı değişiklikler yapılmıştır. Detaylı\ranalizlere ve sonuçlara göre her iki modelin de çalışılan problem için oldukça rekabetçi olduğu gözlemlenmiştir. Ancak uzun planlama vadesine\rsahip veri örnekleri için MILP modelinin CP modelinden çözüm kalitesi ve çözüm süresi açısından daha iyi performans gösterdiği görülmüştür.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 1
    The Modification and the Line Balancing of an Assembly Line for the Inclusion of a New Product Model
    (Springer Science and Business Media Deutschland GmbH, 2020) Dilruba Telli; Yalcin Berberoglu; Gizem Karadeniz; Doğangün Yılmaz Uzun; Elif Baykal; Damla Yüksel; Yigit Kazancoglu; Yüksel, Damla; Karadeniz, Gizem; Telli, Dilruba; Berberoğlu, Yalçın; Kazançoğlu, Yiğit; Uzun, Doğangün Yılmaz; Baykal, Elif; N.M. Durakbasa , M.N. Osman Zahid , R. Abd. Aziz , A.R. Yusoff , N. Mat Yahya , F. Abdul Aziz , M. Yazid Abu , M.G. Gençyilmaz
    This study aims to modify the 5th lean assembly line in order to include a new product model in a combi boiler producer company. After reviewing customers’ needs company decides to produce a new product. New product model will be produced in the one of the existing lines in the plant. Most suitable line determined according to other product models job sequences’ similarity with new product models’. After the analysis of the production process the changes and possible constraints for the 5th assembly line are determined. After that solution procedures are developed the required calculations are made and implemented. The solutions are developed by various techniques and approaches such as Bubble diagram Value Stream Mapping Lean Production Line Balancing. Particularly mathematical model which is solved by IBM ILOG Optimization Studio programmed comprehensive analysis with a simulation model which is conducted by Arena Simulation software are presented in this study. The outcomes of the solutions are simulated compared and automatized. At the end three options are provided for the 5th lean line to include a new product type while continuing the production process with the current products. © 2022 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 9
    Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption
    (IEEE, 2020) Damla Yuksel; Mehmet Fatih Tasgetiren; Levent Kandiller; Quan-Ke Pan; Yuksel, Damla; Tasgetiren, Mehmet Fatih; Kandiller, Levent; Pan, Quan-Ke
    No-wait flowshop scheduling problem (NWFSP) is a well-known strongly NP-hard problem where in-process waiting is not allowed between any two consecutive machines in such a way that once a job is started subsequent processing must be carried out on all machines until completion. In this paper we propose an energy-efficient NWFSP in order to investigate the trade-off between makespan and total energy consumption. The energy-efficient NWFSP aims to seek to obtain Pareto solution sets to minimize the makespan and the total energy consumption conflicting with each other. Unlike the classical NWFSP there are different speed levels for each job on machines and the processing times of jobs can differ according to the assigned speed levels. Therefore we modify the formulation of NWFSP by introducing a speed scaling strategy in order to approximate Pareto solution sets i.e. non-dominated solution sets. In this paper we propose a mixed-integer linear programming model (MILP) an energy-efficient variable block insertion heuristic (EE-VBIH) an energy-efficient iterated greedy algorithm (IG) and an energy-efficient & IG-ALL) to solve the energy-efficient NWFSP. Extensive computational analyses on Taillard's benchmark suite show that the proposed algorithms are very effective for approximating Pareto solution sets.
  • Thumbnail Image
    Article
    Citation - WoS: 48
    Citation - Scopus: 61
    A Green Dual-Channel Closed-Loop Supply Chain Network Design Model
    (ELSEVIER SCI LTD, 2022) Yigit Kazancoglu; Damla Yuksel; Muruvvet Deniz Sezer; Sachin Kumar Mangla; Lianlian Hua; Yuksel, Damla; Sezer, Muruvvet Deniz; Hua, Lianlian; Kazancoglu, Yigit; Mangla, Sachin Kumar
    Environmental considerations have become a significant issue in the design of supply chain networks due to today's increasing globalization trends. Therefore supply chain network design needs to be managed in an efficient way to deal with the complex networks involved. The aim of this article is to present a multi-objective optimization model for a green dual-channel supply chain network that handles economic and environmental objectives to optimize network flow. A complex mixed-integer linear programming model (MILP) has been proposed in a green dual-channel and closed-loop supply chain (CLSC) network design. The main objective of the generated MILP model is to investigate the optimal selection of echelons and the optimal selection of transportation alternatives between these echelons in a CLSC network that includes an e-commerce channel structure based on economic and environmental considerations. Environmental aims are achieved by decreasing CO2 emissions and by reducing PM (particulate matter) concentration throughout the network. In addition economic aims are also met by minimizing the overall cost. The validity of the presented model is supported by a case study in the home appliances industry. The results indicate that this model provides valuable knowledge and various alternatives to managers and policymakers depending on the different weight combinations.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 1
    Standardization of Packaging Materials for Various Products and Cost Optimization in Packaging
    (Springer Science and Business Media Deutschland GmbH, 2020) Özge Ceyhan; Merve Türk; Hafize Helvacı; Damla Yüksel; Nejat Kutup; Yüksel, Damla; Türk, Merve; Ceyhan, Özge; Helvacı, Hafize; Kutup, Nejat; M.N. Osman Zahid , R. Abd. Aziz , A.R. Yusoff , N. Mat Yahya , F. Abdul Aziz , M. Yazid Abu , N.M. Durakbasa , M.G. Gençyilmaz
    This project is related to the standardization of the packaging of variable-size products which belongs to base headboard marquise and cupboard (nightstand) product categories for a bed products company. The company cares importance to special size demands of their customers and produces products in a wide range of sizes. This causes complexity in the stock-tracking of cardboard plates which are the most important packaging materials in the packaging process and high waste of cardboards. Therefore this study aims to improve the packaging system of the company and to reduce the packaging costs by decreasing the amount of waste related to the materials used for packaging. The main objective of the study is to create a standardized packaging plan by considering all product sizes the company has produced in the last three years in the product categories of base headboard marquise and cupboard. To achieve this goal after the completion of literature search forecasts for the next year’s sales were done and a mathematical model that has two conflicting objectives was formulated. Then the mathematical model was solved by using IBM ILOG CPLEX program for each product category and optimal package sizes were determined. A useful Decision Support System (DSS) which enables to prepare weekly packaging plans that reduce the extra packaging costs and the amount of waste has been created at the end of the project. © 2022 Elsevier B.V. All rights reserved.