A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy
Özet
In this paper, we present a problem specific discrete harmony search (DHS) algorithms to solve the economic lot scheduling problem (ELSP) under the extended basic period (EBP) approach and power-of-two (PoT) policy. In particular, DHS algorithms generate
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866870800&doi=10.1109%2fCEC.2012.6256592&partnerID=40&md5=68a138b754782b21a81c08eaf9960982https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10556
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
