default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLevent Kandiller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Funda Güner
, Abdül Kadir Görür, Benhür Satir, Levent Kandiller, John H. Drake:
A constraint programming approach to a real-world workforce scheduling problem for multi-manned assembly lines with sequence-dependent setup times. Int. J. Prod. Res. 62(9): 3212-3229 (2024)- [j11]Damla Yüksel, Levent Kandiller, Mehmet Fatih Tasgetiren:
Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops. Swarm Evol. Comput. 89: 101617 (2024) - 2022
- [j10]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) - [j9]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) - [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) - 2021
- [j7]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
- [j6]Damla Yüksel, Mehmet Fatih Tasgetiren, Levent Kandiller, Liang Gao:
An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption. Comput. Ind. Eng. 145: 106431 (2020) - [j5]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) - [j4]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) - [c5]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 - [c4]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 - [c3]Damla Yüksel, Mehmet Fatih Tasgetiren, Levent Kandiller, Quan-Ke Pan:
Metaheuristics for Energy-Efficient No-Wait Flowshops: A Trade-off Between Makespan and Total Energy Consumption. CEC 2020: 1-8
2010 – 2019
- 2019
- [c2]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 - 2017
- [j3]Sel Özcan, Deniz Türsel Eliiyi, Levent Kandiller:
An alternative MILP model for makespan minimization on assembly lines. Optim. Lett. 11(4): 781-799 (2017) - 2015
- [c1]Levent Kandiller, Deniz Türsel Eliiyi, Bahar Tasar:
A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution. OR 2015: 149-155
2000 – 2009
- 2006
- [j2]Nur Evin Özdemirel, Levent Kandiller:
Semi-dynamic modelling of heterogeneous land combat. J. Oper. Res. Soc. 57(1): 38-51 (2006)
1990 – 1999
- 1998
- [j1]Levent Kandiller:
A cell formation algorithm: Hypergraph approximation - Cut tree. Eur. J. Oper. Res. 109(3): 686-702 (1998)
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-10-07 22:19 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:
