default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHande Öztop
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Hande Öztop, Mehmet Fatih Tasgetiren
, Levent Kandiller, Quan-Ke Pan:
Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion. Comput. Oper. Res. 138: 105616 (2022)- [j6]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) - [j5]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) - 2021
- [j4]Korhan Karabulut, Hande Öztop, Levent Kandiller, Mehmet Fatih Tasgetiren:
Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach. Comput. Oper. Res. 129: 105192 (2021) - 2020
- [j3]Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan, Levent Kandiller:
An energy-efficient permutation flowshop scheduling problem. Expert Syst. Appl. 150: 113279 (2020) - [j2]Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Deniz Türsel Eliiyi, Liang Gao:
Ensemble of metaheuristics for energy-efficient hybrid flowshops: Makespan versus total energy consumption. Swarm Evol. Comput. 54: 100660 (2020) - [c8]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 - [c7]Hande Öztop, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan:
A Novel General Variable Neighborhood Search through Q-Learning for No-Idle Flowshop Scheduling. CEC 2020: 1-8
2010 – 2019
- 2019
- [j1]Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan:
Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput. Oper. Res. 111: 177-196 (2019) - [c6]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 - [c5]Liangshan Shen, Mehmet Fatih Tasgetiren, Hande Öztop, Levent Kandiller, Liang Gao:
A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion. SSCI 2019: 1684-1691 - 2018
- [c4]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 - [c3]Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan:
Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization. GECCO 2018: 379-385 - [c2]Mehmet Fatih Tasgetiren, Hande Öztop, Ugur Eliiyi, Deniz Türsel Eliiyi, Quan-Ke Pan:
Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times. ICIC (1) 2018: 746-758 - [c1]Hande Öztop, Mehmet Fatih Tasgetiren, Deniz Türsel Eliiyi, Quan-Ke Pan:
Green Permutation Flowshop Scheduling: A Trade- off- Between Energy Consumption and Total Flow Time. ICIC (3) 2018: 753-759
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 23:18 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:
