A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy

dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Bulut, O.
dc.contributor.author	Fadiloglu, M.M.
dc.date.accessioned	2021-01-25T20:50:56Z
dc.date.available	2021-01-25T20:50:56Z
dc.date.issued	2012
dc.identifier	10.1109/CEC.2012.6256592
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866870800&doi=10.1109%2fCEC.2012.6256592&partnerID=40&md5=68a138b754782b21a81c08eaf9960982
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10556
dc.description.abstract	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
dc.language.iso	English
dc.publisher	2012 IEEE Congress on Evolutionary Computation, CEC 2012
dc.title	A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy
dc.type	Conference Paper
dc.description.affiliations	Industrial Engineering Department, Yasar University, Izmir, Turkey

Files in this item

Files	Size	Format	View
There are no files associated with this item.