• 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 hybrid flowshop scheduling with total flow time minimization

Thumbnail
Date
2018
Author
Oztop, H.
Tursel Eliiyi, D.
Tasgetiren, M.F.
Pan, Q.K.
Metadata
Show full item record
Abstract
1 The hybrid flosshop scheduling problem (HFSP) has been extensively studied in the literature, due to its complexity and real-life applicability. Various exact and heuristic algorithms have been developed for the HFSP, and most consider makespan as the o
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050630493&doi=10.1145%2f3205455.3205500&partnerID=40&md5=0a6be08edc1f62f5d045261dc7a88e86
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/9961
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