A genetic algorithm for the economic lot scheduling problem under extended basic period approach and power-of-two policy

dc.contributor.author	Bulut, O.
dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Fadiloglu, M.M.
dc.date.accessioned	2021-01-25T20:51:12Z
dc.date.available	2021-01-25T20:51:12Z
dc.date.issued	2011
dc.identifier	10.1007/978-3-642-25944-9_8
dc.identifier.issn	03029743
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-84855665274&doi=10.1007%2f978-3-642-25944-9_8&partnerID=40&md5=7c06990c25fe819c5843d21acec88a2a
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10602
dc.description.abstract	In this study, we propose a genetic algorithm (GA) for the economic lot scheduling problem (ELSP) under extended basic period (EBP) approach and power-of-two (PoT) policy. The proposed GA employs a multi-chromosome solution representation to encode PoT mu
dc.language.iso	English
dc.publisher	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.title	A genetic algorithm for the economic lot scheduling problem under extended basic period approach and power-of-two policy
dc.type	Conference Paper
dc.relation.firstpage	57
dc.relation.lastpage	65
dc.relation.volume	6839 LNAI
dc.description.affiliations	Industrial Engineering Department, Yasar University, Izmir, Turkey; Industrial and Systems Engineering Department, Izmir Economy University, Izmir, Turkey

Files in this item

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