• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
Search 
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • Search
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Search

Show Advanced FiltersHide Advanced Filters

Filters

Use filters to refine the search results.

Now showing items 31-40 of 103

  • Sort Options:
  • Relevance
  • Title Asc
  • Title Desc
  • Issue Date Asc
  • Issue Date Desc
  • Results Per Page:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem 

Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Buyukdagli, O. (Computers and Operations Research, 2013)
This paper presents a variable iterated greedy algorithm (IG) with differential evolution (vIG-DE), designed to solve the no-idle permutation flowshop scheduling problem. In an IG algorithm, size d of jobs are removed from ...
Thumbnail

A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion 

Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Oner, A. (Applied Mathematical Modelling, 2013)
In this paper, we present a discrete artificial bee colony algorithm to solve the no-idle permutation flowshop scheduling problem with the total tardiness criterion. The no-idle permutation flowshop problem is a variant ...
Thumbnail

A variable iterated greedy algorithm with differential evolution for solving no-idle flowshops 

Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Buyukdagli, O. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
In this paper, we present a variable iterated greedy algorithm where its parameters (basically destruction size and probability of whether or not to apply the iterated greedy algorithm to an individual) are optimized by ...
Thumbnail

Solving fuzzy job-shop scheduling problem by a hybrid PSO algorithm 

Li, J.; Pan, Q.K.; Suganthan, P.N.; Tasgetiren, M.F. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
This paper proposes a hybrid particle swarm optimization (PSO) algorithm for solving the job-shop scheduling problem with fuzzy processing times. The objective is to minimize the maximum fuzzy completion time, i.e., the ...
Thumbnail

A DE based variable iterated greedy algorithm for the no-idle permutation flowshop scheduling problem with total flowtime criterion 

Tasgetiren, M.F.; Pan, Q.K.; Wang, L.; Chen, A.H.L. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011)
In this paper, we present a variable iterated greedy (vIGP-DE) algorithm where its parameters (basically destruction size and cooling parameter for the simulated annealing type of acceptance criterion) are optimized by the ...
Thumbnail

A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops 

Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Chen, A.H.L. (Information Sciences, 2011)
Obtaining an optimal solution for a permutation flowshop scheduling problem with the total flowtime criterion in a reasonable computational timeframe using traditional approaches and optimization tools has been a challenge. ...
Thumbnail

A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion 

Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Jin Chua, T. (International Journal of Production Research, 2011)
In this paper, we investigate the use of a continuous algorithm for the no-idle permutation flowshop scheduling (NIPFS) problem with tardiness criterion. For this purpose, a differential evolution algorithm with variable ...
Thumbnail

A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem 

Wang, L.; Pan, Q.K.; Tasgetiren, M.F. (Computers and Industrial Engineering, 2011)
This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value ...
Thumbnail

A differential evolution algorithm for the median cycle problem 

Tasgetiren, M.F.; Pan, Q.K.; Bulut, C.; Suganthan, P.N. (IEEE SSCI 2011 - Symposium Series on Computational Intelligence - SDE 2011: 2011 IEEE Symposium on Differential Evolution, 2011)
This paper extends the applications of differential evolution algorithms to the Median Cycle Problem. The median cycle problem is concerned with constructing a simple cycle composed of a subset of vertices of a mixed graph. ...
Thumbnail

Differential evolution algorithm with ensemble of parameters and mutation strategies 

Mallipeddi, R.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F. (Applied Soft Computing Journal, 2011)
Differential evolution (DE) has attracted much attention recently as an effective approach for solving numerical optimization problems. However, the performance of DE is sensitive to the choice of the mutation strategy and ...
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • . . .
  • 11





Creative Commons License
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV
 

 




| Politika | Rehber | İletişim |

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy LanguageThis CommunityBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy Language

My Account

LoginRegister

Discover

Author
Pan, Q.K. (103)
Tasgetiren, M.F. (103)
Suganthan, P.N. (50)Kizilay, D. (15)Gao, K.Z. (9)Tursel Eliiyi, D. (9)Chen, A.H.L. (8)Oztop, H. (8)Wang, L. (8)Buyukdagli, O. (6)... View MoreSubjectTotal flowtime (2)Distributed mixed no-idle flowshop (1)Distributed permutation flowshop scheduling (1)Energy efficient (1)Flowshop (1)Iterated Greedy (1)Multi-objective optimization (1)NSGA-II (1)Scheduling (1)Total energy consumption (1)... View MoreDate Issued2020 - 2021 (11)2010 - 2019 (92)Has File(s)No (101)Yes (2)

DSpace software copyright © 2002-2016  DuraSpace
Contact Us | Send Feedback
Theme by 
Atmire NV