• 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 1-6 of 6

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

Variable block insertion heuristic for the quadratic assignment problem 

Tasgetiren, M.F.; Pan, Q.K.; Ozturkoglu, Y.; Cotur, O.K. (2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...
Thumbnail

A variable block insertion heuristic for permutation flowshops with makespan criterion 

Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Velez-Gallego, M.C. (2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
Thumbnail

Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion 

Tasgetiren, M.F.; Kizilay, D.; Pan, Q.K.; Suganthan, P.N. (Computers and Operations Research, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
Thumbnail

Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion 

Tasgetiren, M.F.; Kizilay, D.; Pan, Q.K.; Suganthan, P.N. (PERGAMON-ELSEVIER SCIENCE LTD, 2017)
Recently, iterated greedy algorithms have been successfully applied to solve a variety of combinatorial optimization problems. This paper presents iterated greedy algorithms for solving the blocking flowshop scheduling ...
Thumbnail

A variable block insertion heuristic for permutation flowshops with makespan criterion 

Tasgetiren, M.F.; Pan, Q.K.; Kizilay, D.; Velez-Gallego, M.C. (IEEE, 2017)
This paper proposes a populated variable block insertion heuristic (PVBIH) algorithm for solving the permutation flowshop scheduling problem with the makespan criterion. The PVBIH algorithm starts with a minimum block size ...
Thumbnail

Variable Block Insertion Heuristic for the Quadratic Assignment Problem 

Tasgetiren, M.F.; Pan, Q.K.; Ozturkoglu, Y.; Cotur, O.K. (IEEE, 2017)
The aim of this paper is to apply the variable block insertion heuristic (VBIH) algorithm recently proposed in the literature for solving the quadratic assignment problem (QAP). The VBIH algorithm is concerned with making ...





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. (6)
Tasgetiren, M.F. (6)Kizilay, D. (4)Cotur, O.K. (2)Ozturkoglu, Y. (2)Suganthan, P.N. (2)Velez-Gallego, M.C. (2)Date Issued
2017 (6)
Has File(s)
No (6)

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