Basit öğe kaydını göster

dc.contributor.authorBulut, O.
dc.contributor.authorTasgetiren, M.F.
dc.date.accessioned2021-01-25T19:34:57Z
dc.date.available2021-01-25T19:34:57Z
dc.date.issued2014
dc.identifier.urihttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/8060
dc.description.abstractIn this study, we model the Economic Lot Scheduling problem with returns (ELSPR) under the basic period (BP) policy with power-of-two (PoT) multipliers, and solve it with a discrete artificial bee colony (DABC) algorithm. Tang and Teunter [1] is the first
dc.language.isoEnglish
dc.publisherIEEE
dc.titleA Discrete Artificial Bee Colony Algorithm for the Economic Lot Scheduling Problem with Returns
dc.typeProceedings Paper
dc.relation.firstpage551
dc.relation.lastpage557
dc.description.woscategoryComputer Science, Artificial Intelligence; Computer Science, Theory & Methods; Engineering, Electrical & Electronic
dc.description.wosresearchareaComputer Science; Engineering
dc.identifier.wosidWOS:000356684600077
dc.identifier.ctitleIEEE Congress on Evolutionary Computation (CEC)
dc.identifier.cdateJUL 06-11, 2014


Bu öğenin dosyaları:

DosyalarBoyutBiçimGöster

Bu öğe ile ilişkili dosya yok.

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster