• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
Search 
  •   DSpace Home
  • Search
  •   DSpace Home
  • 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 11-14 of 14

  • 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 local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem 

Pan, Q.K.; Suganthan, P.N.; Liang, J.J.; Tasgetiren, M.F. (PERGAMON-ELSEVIER SCIENCE LTD, 2011)
In this paper, a local-best harmony search (HS) algorithm with dynamic sub-harmony memories (HM), namely DLHS algorithm, is proposed to minimize the total weighted earliness and tardiness penalties for a lot-streaming flow ...
Thumbnail

Differential evolution algorithm with ensemble of parameters and mutation strategies 

Mallipeddi, R.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F. (ELSEVIER, 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 ...
Thumbnail

A Differential Evolution Algorithm for the Median Cycle Problem 

Tasgetiren, M.F.; Pan, Q.K.; Bulut, O.; Suganthan, P.N. (IEEE, 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

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

Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Chua, T.J. (TAYLOR & FRANCIS LTD, 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 ...
  • 1
  • 2





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 Language

My Account

LoginRegister

Discover

AuthorPan, Q.K. (14)
Suganthan, P.N. (14)
Tasgetiren, M.F. (14)
Chua, T.J. (3)Chen, A.H.L. (2)Liang, J.J. (2)Mallipeddi, R. (2)Zhao, S.Z. (2)Bulut, C. (1)Bulut, O. (1)... View MoreDate Issued
2011 (14)
Has File(s)No (14)

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