default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamla Kizilay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j9]Korhan Karabulut, Damla Kizilay, Mehmet Fatih Tasgetiren
, Liang Gao, Levent Kandiller:
An evolution strategy approach for the distributed blocking flowshop scheduling problem. Comput. Ind. Eng. 163: 107832 (2022)- [j8]Korhan Karabulut, Hande Öztop, Damla Kizilay, Mehmet Fatih Tasgetiren, Levent Kandiller:
An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 142: 105733 (2022) - [j7]Damla Kizilay:
A novel constraint programming and simulated annealing for disassembly line balancing problem with AND/OR precedence and sequence dependent setup times. Comput. Oper. Res. 146: 105915 (2022) - [j6]Zeynel Abidin Çil, Damla Kizilay, Zixiang Li, Hande Öztop:
Two-sided disassembly line balancing problem with sequence-dependent setup time: A constraint programming model and artificial bee colony algorithm. Expert Syst. Appl. 203: 117529 (2022) - 2020
- [j5]Zeynel Abidin Çil, Damla Kizilay:
Constraint programming model for multi-manned assembly line balancing problem. Comput. Oper. Res. 124: 105069 (2020) - [j4]Damla Kizilay, Pascal Van Hentenryck, Deniz Türsel Eliiyi:
Constraint programming models for integrated container terminal operations. Eur. J. Oper. Res. 286(3): 945-962 (2020) - [c12]Ahmad Abdulla Al-Buenain, Damla Kizilay, Ozge Buyukdagli, Mehmet Fatih Tasgetiren:
A Novel Differential Evolution Algorithm with Q-Learning for Economical and Statistical Design of X-Bar Control Charts. CEC 2020: 1-8 - [c11]Damla Kizilay, Mehmet Fatih Tasgetiren, Hande Öztop, Levent Kandiller, Ponnuthurai N. Suganthan:
A Differential Evolution Algorithm with Q-Learning for Solving Engineering Design Problems. CEC 2020: 1-8
2010 – 2019
- 2019
- [j3]Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Liang Gao:
A Variable Block Insertion Heuristic for Solving Permutation Flow Shop Scheduling Problem with Makespan Criterion. Algorithms 12(5): 100 (2019) - [c10]Jiaxin Fan, Damla Kizilay, Hande Öztop, Mehmet Fatih Tasgetiren, Liang Gao:
A Variable Block Insertion Heuristic for Single Machine with Release Dates and Sequence Dependent Setup Times for Makespan Minimization. SSCI 2019: 1676-1683 - [c9]Sihan Wang, Jia Kang, Mehmet Fatih Tasgetiren, Liang Gao, Damla Kizilay:
Differential Evolution Through Variable Neighborhood Search for Constrained Real-Parameter Optimization Problems. SSCI 2019: 2252-2260 - 2018
- [c8]Damla Kizilay, Deniz Türsel Eliiyi, Pascal Van Hentenryck:
Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations. CPAIOR 2018: 344-360 - [c7]Mehmet Fatih Tasgetiren, Ugur Eliiyi, Hande Öztop, Damla Kizilay, Quan-Ke Pan:
An energy-efficient single machine scheduling with release dates and sequence-dependent setup times. GECCO (Companion) 2018: 145-146 - 2017
- [j2]Mehmet Fatih Tasgetiren, Damla Kizilay, Quan-Ke Pan, Ponnuthurai N. Suganthan:
Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput. Oper. Res. 77: 111-126 (2017) - [c6]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Mario C. Vélez-Gallego:
A variable block insertion heuristic for permutation flowshops with makespan criterion. CEC 2017: 726-733 - [i1]Damla Kizilay, Deniz Türsel Eliiyi, Pascal Van Hentenryck:
Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations. CoRR abs/1712.05302 (2017) - 2016
- [j1]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Kaizhou Gao:
A Variable Block Insertion Heuristic for the Blocking Flowshop Scheduling Problem with Total Flowtime Criterion. Algorithms 9(4): 71 (2016) - 2015
- [c5]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Gürsel A. Süer:
A populated local search with differential evolution for blocking flowshop scheduling problem. CEC 2015: 2789-2796 - [c4]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Damla Kizilay, Gürsel A. Süer:
A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem. CEC 2015: 2797-2804 - 2014
- [c3]Damla Kizilay, Mehmet Fatih Tasgetiren, Önder Bulut, Bilgehan Bostan:
A discrete artificial bee colony algorithm for the assignment and parallel machine scheduling problem in DYO paint company. IEEE Congress on Evolutionary Computation 2014: 653-660 - [c2]Damla Kizilay, Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ling Wang:
An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion. CIPLS 2014: 16-23 - 2013
- [c1]Mehmet Fatih Tasgetiren, Ozge Buyukdagli, Damla Kizilay, Korhan Karabulut:
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem. SEMCCO (1) 2013: 1-12
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
