A discrete artificial bee colony algorithm for the Economic Lot Scheduling problem with returns

dc.contributor.author	Bulut, O.
dc.contributor.author	Tasgetiren, M.F.
dc.date.accessioned	2021-01-25T20:50:13Z
dc.date.available	2021-01-25T20:50:13Z
dc.date.issued	2014
dc.identifier	10.1109/CEC.2014.6900524
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84908587577&doi=10.1109%2fCEC.2014.6900524&partnerID=40&md5=d3e4cf21628c498f9933bfbddfa1cd09
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10418
dc.description.abstract	In 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.iso	English
dc.publisher	Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
dc.title	A discrete artificial bee colony algorithm for the Economic Lot Scheduling problem with returns
dc.type	Conference Paper
dc.relation.firstpage	551
dc.relation.lastpage	557
dc.description.affiliations	Dept of Engineering, Yasar University, Izmir, Turkey

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.