Damla Kizilay
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Damla Kizilay has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Mehmet Fatih Tasgetiren
Qatar University
11 shared publications - Zeynel Abidin Çil
Izmir Democracy University
8 shared publications Quan-Ke Pan
Huazhong University of Science and Technology, Wuhan, P.R. China
5 shared publications- Hande Öztop
İzmir Demokrasi Üniversitesi
4 shared publications - Deniz Türsel Eliiyi
İZMİR BAKIRÇAY ÜNİVERSİTESİ
3 shared publications - Quan-Ke Pan
School of Mechatronic Engineering and Automation, Shanghai University, Shanghai, P. R. China
3 shared publications
Latest Publications
- 3 June 2026
- Published by Springer Nature
- p. 790-798
Integrated Unrelated and Uniform Parallel Machine Scheduling Problem with Machine Group Selection
- 3 June 2026
- Published by Springer Nature
- p. 790-798
Integrated Unrelated and Uniform Parallel Machine Scheduling Problem with Machine Group Selection
- 3 May 2025
- Published by Springer Nature
- p. 171-185
Modified Simulated Annealing Algorithm for Drone and Truck Routing Problem
- 3 May 2025
- Published by Springer Nature
- p. 171-185
Modified Simulated Annealing Algorithm for Drone and Truck Routing Problem
- Open Access
- 1 January 2025
- Published by Journal of Yasar University in Journal of Yaşar University
- Vol. 20 (78) , 231-248
A No-Wait Flowshop Scheduling Problem with Batch Delivery System
This study investigates the no-wait permutation flowshop scheduling problem (NWPFSP). This type of problem adds constraints to the permutation flow type scheduling problem in that jobs are prohibited from waiting between machines during processing. The NWFSP is a common problem type in industry. After processing jobs on machines, products are distributed to several customers. It is recommended that products be transferred immediately after they are finished on a production line to avoid delays. However, this approach may lead to high distribution costs. Consequently, a balance between distribution costs and delay must be considered when making operational decisions. Grouping products for delivery is an effective way to reduce the cost of distribution and is called batch delivery (BD) in literature. For this reason, the integration of the NWFSP with the batch delivery (BD) is addressed by minimizing the total delay and batch delivery costs. This problem is called the No-Wait Flowshop Scheduling Problem with Batch Delivery (NWFSPBD). For this integrated production and distribution problem, the Mixed-Integer Linear Programming Model (MILPM) and Constraint Programming Model (CPM) were developed. These two mathematical models were tested on the instance sets that were produced regarding the related literature. Since the problem is complex, both models have difficulty obtaining an optimal solution within the specified time limit. However, when the results of the CPM are compared with the results of the MILPM, it finds either the same or better results for each data set. Therefore, the CPM has high applicability as it can achieve better results.
- 1 January 2025
- Published by Journal of Yasar University in Journal of Yaşar University
- Vol. 20 (78) , 231-248
Open AccessA No-Wait Flowshop Scheduling Problem with Batch Delivery System
This study investigates the no-wait permutation flowshop scheduling problem (NWPFSP). This type of problem adds constraints to the permutation flow type scheduling problem in that jobs are prohibited from waiting between machines during processing. The NWFSP is a common problem type in industry. After processing jobs on machines, products are distributed to several customers. It is recommended that products be transferred immediately after they are finished on a production line to avoid delays. However, this approach may lead to high distribution costs. Consequently, a balance between distribution costs and delay must be considered when making operational decisions. Grouping products for delivery is an effective way to reduce the cost of distribution and is called batch delivery (BD) in literature. For this reason, the integration of the NWFSP with the batch delivery (BD) is addressed by minimizing the total delay and batch delivery costs. This problem is called the No-Wait Flowshop Scheduling Problem with Batch Delivery (NWFSPBD). For this integrated production and distribution problem, the Mixed-Integer Linear Programming Model (MILPM) and Constraint Programming Model (CPM) were developed. These two mathematical models were tested on the instance sets that were produced regarding the related literature. Since the problem is complex, both models have difficulty obtaining an optimal solution within the specified time limit. However, when the results of the CPM are compared with the results of the MILPM, it finds either the same or better results for each data set. Therefore, the CPM has high applicability as it can achieve better results.
- 1 January 2024
- Published by Growing Science in Journal of Project Management
- Vol. 9 (2) , 85-100
Solving blocking flowshop scheduling problem with makespan criterion using q-learning-based iterated greedy algorithms
- 1 January 2024
- Published by Growing Science in Journal of Project Management
- Vol. 9 (2) , 85-100
Solving blocking flowshop scheduling problem with makespan criterion using q-learning-based iterated greedy algorithms
- Open Access
- 28 September 2023
- Published by Muhendislik Bilimleri ve Tasarim Dergisi in Mühendislik Bilimleri ve Tasarım Dergisi
- Vol. 11 (3) , 1030-1053
FARKLI PERFORMANS KRİTERLERİ ALTINDA PARALEL MAKİNE ÇİZELGELEME PROBLEMİ
Üretim planlama faaliyetleri arasında oldukça önemli bir yere sahip olan paralel makine çizelgeleme problemi, işlerin hangi kaynaklar kullanılarak üretileceğinin ve hangi makineye hangi sırada atanacağının belirlenmesidir. Üretim ortamında kaynakların aktif kullanımı ve müşteri memnuniyeti sağlama gibi amaçları gerçekleştirmek, işlerin çizelgelenmesinin iyi bir şekilde yapılıp yapılmaması ile ilgili olmasının yanı sıra amaç fonksiyonu seçimi ile de doğrudan ilişkilidir. Bu çalışmada ele alınan çizelgeleme probleminde, özdeş olmayan paralel makineler, makine ve işlerin hazırlık zamanları ve işler arasındaki sıra bağımlı ayar zamanları düşünülmüştür. Çalışmada, literatürde sıkça yer alan ve firmalar/araştırmacılar tarafından optimize edilmeye çalışılan amaç fonksiyonlarının birbirlerini nasıl etkilediği ve çeşitli kısıtlardan nasıl etkilendiği analiz edilerek literatüre katkı sağlanması hedeflenmiştir. Çalışmanın çözüm yöntemi olarak karma tamsayılı programlama modeli kurulmuş, elde edilen sonuçlar için basit bir ara yüz oluşturularak duyarlılık analizleri yapılmıştır. Ele alınan problemin NP-zor sınıfında bulunması sebebiyle büyük boyutlu veri setleri için sezgisel yöntemlere başvurulmuştur. Bu kapsamda altı farklı komşuluk arama sezgiseli kullanılarak sezgisel yöntemlerin sonuçları tüm amaç fonksiyonları için karşılaştırılmış olup, hangi komşuluk arama sezgiselinin hangi amaç fonksiyonu için daha iyi çalıştığı analiz edilmiştir. Geliştirilen algoritma ile elde edilen olurlu çözümler incelenerek amaç fonksiyonlarının duyarlılık analizleri gerçekleştirilmiştir.
- 28 September 2023
- Published by Muhendislik Bilimleri ve Tasarim Dergisi in Mühendislik Bilimleri ve Tasarım Dergisi
- Vol. 11 (3) , 1030-1053
Open AccessFARKLI PERFORMANS KRİTERLERİ ALTINDA PARALEL MAKİNE ÇİZELGELEME PROBLEMİ
Üretim planlama faaliyetleri arasında oldukça önemli bir yere sahip olan paralel makine çizelgeleme problemi, işlerin hangi kaynaklar kullanılarak üretileceğinin ve hangi makineye hangi sırada atanacağının belirlenmesidir. Üretim ortamında kaynakların aktif kullanımı ve müşteri memnuniyeti sağlama gibi amaçları gerçekleştirmek, işlerin çizelgelenmesinin iyi bir şekilde yapılıp yapılmaması ile ilgili olmasının yanı sıra amaç fonksiyonu seçimi ile de doğrudan ilişkilidir. Bu çalışmada ele alınan çizelgeleme probleminde, özdeş olmayan paralel makineler, makine ve işlerin hazırlık zamanları ve işler arasındaki sıra bağımlı ayar zamanları düşünülmüştür. Çalışmada, literatürde sıkça yer alan ve firmalar/araştırmacılar tarafından optimize edilmeye çalışılan amaç fonksiyonlarının birbirlerini nasıl etkilediği ve çeşitli kısıtlardan nasıl etkilendiği analiz edilerek literatüre katkı sağlanması hedeflenmiştir. Çalışmanın çözüm yöntemi olarak karma tamsayılı programlama modeli kurulmuş, elde edilen sonuçlar için basit bir ara yüz oluşturularak duyarlılık analizleri yapılmıştır. Ele alınan problemin NP-zor sınıfında bulunması sebebiyle büyük boyutlu veri setleri için sezgisel yöntemlere başvurulmuştur. Bu kapsamda altı farklı komşuluk arama sezgiseli kullanılarak sezgisel yöntemlerin sonuçları tüm amaç fonksiyonları için karşılaştırılmış olup, hangi komşuluk arama sezgiselinin hangi amaç fonksiyonu için daha iyi çalıştığı analiz edilmiştir. Geliştirilen algoritma ile elde edilen olurlu çözümler incelenerek amaç fonksiyonlarının duyarlılık analizleri gerçekleştirilmiştir.
- 2 March 2023
- Published by Springer Nature
- p. 453-461
A Novel Mathematical Model for Mixed-Blocking Permutation Flow Shop Scheduling Problem with Batch Delivery
- 2 March 2023
- Published by Springer Nature
- p. 453-461
A Novel Mathematical Model for Mixed-Blocking Permutation Flow Shop Scheduling Problem with Batch Delivery
- 2 March 2023
- Published by Springer Nature
- p. 86-99
Ranking of Academic Journals in Industrial Engineering
- 2 March 2023
- Published by Springer Nature
- p. 86-99
Ranking of Academic Journals in Industrial Engineering
- 30 June 2021
- Published by International Journal of Pure and Applied Sciences in International Journal of Pure and Applied Sciences
- Vol. 7 (1) , 152-162
Adaptive Large Neighborhood Search Heuristic for Mixed Blocking Flowshop Scheduling Problem
Traditional permutation flowshop scheduling problem (PFSP), which has unlimited buffer space, has been interested over the fifty years by several authors to account for many industrial applications. However, some industries, such as the aerospace industry and other sectors processing industrial waste, have different blocking conditions due to the limited or lack of buffer area between their machines. In this study, a mixture of different blocking types is considered to solve PFSP with the total flow time criterion regarding several blocking types. A constraint programming model is proposed to solve the PFSP with mixed blocking constraints (MBFSP). Due to the problem's NP-hard nature of the problem, an adaptive large neighborhood search heuristic is proposed to solve the large size instances. The results of the proposed algorithm are very competitive.
- 30 June 2021
- Published by International Journal of Pure and Applied Sciences in International Journal of Pure and Applied Sciences
- Vol. 7 (1) , 152-162
Adaptive Large Neighborhood Search Heuristic for Mixed Blocking Flowshop Scheduling Problem
Traditional permutation flowshop scheduling problem (PFSP), which has unlimited buffer space, has been interested over the fifty years by several authors to account for many industrial applications. However, some industries, such as the aerospace industry and other sectors processing industrial waste, have different blocking conditions due to the limited or lack of buffer area between their machines. In this study, a mixture of different blocking types is considered to solve PFSP with the total flow time criterion regarding several blocking types. A constraint programming model is proposed to solve the PFSP with mixed blocking constraints (MBFSP). Due to the problem's NP-hard nature of the problem, an adaptive large neighborhood search heuristic is proposed to solve the large size instances. The results of the proposed algorithm are very competitive.