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-25T19:35:44Z
dc.date.available	2021-01-25T19:35:44Z
dc.date.issued	2012
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/8205
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	IEEE
dc.title	A Discrete Harmony Search Algorithm for the Economic Lot Scheduling Problem with Power of Two Policy
dc.type	Proceedings Paper
dc.description.woscategory	Engineering, Electrical & Electronic; Mathematical & Computational Biology
dc.description.wosresearcharea	Engineering; Mathematical & Computational Biology
dc.identifier.wosid	WOS:000312859303024
dc.identifier.ctitle	IEEE Congress on Evolutionary Computation (CEC)
dc.identifier.cdate	JUN 10-15, 2012

Files in this item

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