Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehmet Fatih Tasgetiren
Publications
- 2010
[c22]Quan-Ke Pan, Mehmet Fatih Tasgetiren
, Ponnuthurai Nagaratnam Suganthan, Yun-Chia Liang:
Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm. IEEE Congress on Evolutionary Computation 2010: 1-6- 2009
- [j4]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang:
A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Comput. Oper. Res. 36(6): 1900-1915 (2009) - [c19]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Yun-Chia Liang:
A differential evolution algorithm with variable parameter search for real-parameter continuous function optimization. IEEE Congress on Evolutionary Computation 2009: 1247-1254 - 2008
- [j3]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput. Ind. Eng. 55(4): 795-816 (2008) - [j2]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Oper. Res. 35(9): 2807-2839 (2008) - [c16]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang:
A discrete differential evolution algorithm for single machine total weighted tardiness problem with sequence dependent setup times. IEEE Congress on Evolutionary Computation 2008: 2613-2620 - [c15]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang, Ponnuthurai N. Suganthan:
Upper bounds on Taillard's benchmark suite for the no-wait flowshop scheduling problem with makespan criterion. IEEE Congress on Evolutionary Computation 2008: 2955-2961 - 2007
- [j1]Mehmet Fatih Tasgetiren, Yun-Chia Liang, Mehmet Sevkli, Günes Gençyilmaz:
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur. J. Oper. Res. 177(3): 1930-1947 (2007) - [c13]Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan, Quan-Ke Pan, Yun-Chia Liang:
A genetic algorithm for the generalized traveling salesman problem. IEEE Congress on Evolutionary Computation 2007: 2382-2389 - [c11]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan, Yun-Chia Liang:
A Discrete Differential Evolution Algorithm for the No-Wait Flowshop Scheduling Problem with Total Flowtime Criterion. CISched 2007: 251-258 - [c10]Mehmet Fatih Tasgetiren, Quan-Ke Pan, Yun-Chia Liang, Ponnuthurai Nagaratnam Suganthan:
A Discrete Differential Evolution Algorithm for the Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine. CISched 2007: 271-278 - [c9]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A discrete differential evolution algorithm for the permutation flowshop scheduling problem. GECCO 2007: 126-133 - 2006
- [c7]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm. ANTS Workshop 2006: 460-467 - [c5]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A Discrete Particle Swarm Optimization Algorithm for Single Machine Total Earliness and Tardiness Problem with a Common Due Date. IEEE Congress on Evolutionary Computation 2006: 3281-3288 - [c4]Quan-Ke Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion. SGAI Conf. 2006: 19-31 - 2004
- [c3]Mehmet Fatih Tasgetiren, Mehmet Sevkli, Yun-Chia Liang, Günes Gençyilmaz:
Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem. ANTS Workshop 2004: 382-389 - [c2]Mehmet Fatih Tasgetiren, Mehmet Sevkli, Yun-Chia Liang, Günes Gençyilmaz:
Particle swarm optimization algorithm for single machine total weighted tardiness problem. IEEE Congress on Evolutionary Computation 2004: 1412-1419
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-21 16: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:
