default search action
Deniz Türsel Eliiyi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Oguz Emrah Turgut, Mert Sinan Turgut, Ali Çaglar Önçag, Ugur Eliiyi, Deniz Türsel Eliiyi:
Q-learning-based hyper-heuristic framework for estimating the energy consumption of electric buses for public transport. Iran J. Comput. Sci. 7(3): 423-483 (2024) - 2021
- [c9]Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi:
A Greedy Algorithm for Minimum Cut into Bounded Sets Problem. CNSM 2021: 422-426 - 2020
- [j12]Volkan Rodoplu
, Mert Nakip
Multi-Channel Joint Forecasting-Scheduling for the Internet of Things. IEEE Access 8: 217324-217354 (2020) - [j11]Mert Sinan Turgut
Island-based Crow Search Algorithm for solving optimal control problems. Appl. Soft Comput. 90: 106170 (2020) - [j10]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) - [j9]Hande Öztop, Mehmet Fatih Tasgetiren
An energy-efficient permutation flowshop scheduling problem. Expert Syst. Appl. 150: 113279 (2020) - [j8]Volkan Rodoplu
A Multiscale Algorithm for Joint Forecasting-Scheduling to Solve the Massive Access Problem of IoT. IEEE Internet Things J. 7(9): 8572-8589 (2020) - [j7]Hande Öztop, Mehmet Fatih Tasgetiren
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption. Swarm Evol. Comput. 54: 100660 (2020) - [c8]Onur Ugurlu, Vahid Khalilpour Akram, Deniz Türsel Eliiyi:
A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation. CNSM 2020: 1-6 - [c7]Deniz Türsel Eliiyi, Hilal Arslan
Parallel Identification of Central Nodes in Wireless Multi-hop Networks. SIU 2020: 1-4
2010 – 2019
- 2019
- [j6]Hande Öztop, Mehmet Fatih Tasgetiren
Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput. Oper. Res. 111: 177-196 (2019) - 2018
- [c6]Damla Kizilay
Constraint and Mathematical Programming Models for Integrated Port Container Terminal Operations. CPAIOR 2018: 344-360 - [c5]Hande Öztop, Mehmet Fatih Tasgetiren
Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization. GECCO 2018: 379-385 - [c4]Mehmet Fatih Tasgetiren
Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times. ICIC (1) 2018: 746-758 - [c3]Hande Öztop, Mehmet Fatih Tasgetiren
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time. ICIC (3) 2018: 753-759 - 2017
- [j5]Sel Özcan
An alternative MILP model for makespan minimization on assembly lines. Optim. Lett. 11(4): 781-799 (2017) - [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) - 2015
- [c2]Levent Kandiller
A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution. OR 2015: 149-155 - 2014
- [j4]Leyla Demir
The state of the art on buffer allocation problem: a comprehensive survey. J. Intell. Manuf. 25(3): 371-392 (2014) - 2013
- [j3]Leyla Demir
Two approaches for solving the buffer allocation problem in unreliable production lines. Comput. Oper. Res. 40(10): 2556-2563 (2013) - [c1]Leyla Demir
A Comparison of Three Search Algorithms for Solving the Buffer Allocation Problem in Reliable Production Lines. MIM 2013: 1626-1631 - 2012
- [j2]Leyla Demir
An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines. Comput. Oper. Res. 39(7): 1477-1486 (2012)
2000 – 2009
- 2008
- [j1]Deniz Türsel Eliiyi
A Lagrangean relaxation approach for the mixed-model flow line sequencing problem. Comput. Oper. Res. 35(3): 933-943 (2008) - 2004
- [b1]Deniz Türsel Eliiyi:
Operational fixed job scheduling problem ; Operasyonel sabit iş çizelgelemesi problemi. Middle East Technical University, Çankaya, Ankara, Turkey, 2004
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-09-26 00:58 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: