• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
Search 
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • WoS İndeksli Yayınlar Koleksiyonu
  • Search
  •   DSpace Home
  • ARAŞTIRMA ÇIKTILARI (WoS-Scopus-TR-Dizin-PubMed)
  • WoS İndeksli Yayınlar Koleksiyonu
  • 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 47

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

Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm 

Li, J.Q.; Pan, Q.K.; Suganthan, P.N.; Tasgetiren, M.F. (SPRINGER-VERLAG BERLIN, 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 discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem 

Pan, Q.K.; Tasgetiren, M.F.; Suganthan, P.N.; Chua, T.J. (ELSEVIER SCIENCE INC, 2011)
In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lot-streaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both 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. (ELSEVIER SCIENCE INC, 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 hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem 

Wang, L.; Pan, Q.K.; Tasgetiren, M.F. (PERGAMON-ELSEVIER SCIENCE LTD, 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

Dynamic multi-swarm particle swarm optimizer with harmony search 

Zhao, S.Z.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F. (PERGAMON-ELSEVIER SCIENCE LTD, 2011)
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) is improved by hybridizing it with the harmony search (HS) algorithm and the resulting algorithm is abbreviated as DMS-PSO-HS. We present a novel ...
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

An Adaptive Iterated Greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems 

Li, Y.Z.; Pan, Q.K.; Li, J.Q.; Tasgetiren, M.F.; Gao, L. (Elsevier, 2021-06)
Distributed flow shop scheduling is a very interesting research topic. This paper studies the distributed permutation flow shop scheduling problem with mixed no-idle constraints, which have important applications in practice. ...
Thumbnail

Solving Lot-streaming Flow Shop Scheduling Problems Using a Discrete Harmony Search Algorithm 

Pan, Q.K.; Tasgetiren, M.F.; Suganthan, P.N.; Liang, Y.C. (IEEE, 2010)
The harmony search (HS) algorithm is one of the recent evolutionary computation techniques to solve optimization problems. To make it applicable for lot-streaming flow shop problems, a discrete variant of the HS algorithm ...
  • 1
  • 2
  • 3
  • 4
  • 5





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 CollectionBy Issue DateAuthorsTitlesSubjectsBy TypeBy PublisherBy Language

My Account

LoginRegister

Discover

Author
Pan, Q.K. (47)
Tasgetiren, M.F. (47)Suganthan, P.N. (25)Kizilay, D. (7)Chen, A.H.L. (4)Gao, K.Z. (4)Tursel Eliiyi, D. (4)Wang, L. (4)Buyukdagli, O. (3)Li, J.Q. (3)... View MoreSubjectDistributed mixed no-idle flowshop (1)Flowshop (1)Iterated Greedy (1)Scheduling (1)Total flowtime (1)... View MoreDate Issued2020 - 2021 (3)2010 - 2019 (44)Has File(s)No (46)Yes (1)

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