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

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

Thumbnail
Date
2017
Author
Tasgetiren, M.F.
Kizilay, D.
Pan, Q.K.
Suganthan, P.N.
Metadata
Show full item record
Abstract
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 problem (BFSP) with the makespan cri
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982854598&doi=10.1016%2fj.cor.2016.07.002&partnerID=40&md5=6e9d916fe7389f73455fc3b13352db0e
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10143
Collections
  • Scopus İndeksli Yayınlar Koleksiyonu





Creative Commons License
[email protected] 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

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