A note on "The economic lot sizing problem with inventory bounds"

Basit Öğe Kaydı
dc.authorid0000-0002-0219-9581
dc.authorid0000-0002-6633-5941
dc.contributor.authorÖnal, Mehmeten_US
dc.contributor.authorVan den Heuvel, Wilcoen_US
dc.contributor.authorLiu, Tiemingen_US
dc.date.accessioned2015-01-15T23:02:03Z
dc.date.available2015-01-15T23:02:03Z
dc.date.issued2012-11-06
dc.departmentIşık Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.departmentIşık University, Faculty of Engineering, Department of Industrial Engineeringen_US
dc.description.abstractIn a recent paper, Liu [3] considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n(2)) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains the 0(n2) complexity.en_US
dc.description.versionPublisher's Versionen_US
dc.identifier.citationÖnal, M., Heuvel, W. & Liu, T. (2012). A note on "the economic lot sizing problem with inventory bounds". European Journal of Operational Research, 223(1), 290-294. doi:10.1016/j.ejor.2012.05.019en_US
dc.identifier.doi10.1016/j.ejor.2012.05.019
dc.identifier.endpage294
dc.identifier.issn0377-2217
dc.identifier.issn1872-6860
dc.identifier.issue1
dc.identifier.scopus2-s2.0-84864431340
dc.identifier.scopusqualityQ1
dc.identifier.startpage290
dc.identifier.urihttps://hdl.handle.net/11729/432
dc.identifier.urihttp://dx.doi.org/10.1016/j.ejor.2012.05.019
dc.identifier.volume223
dc.identifier.wosWOS:000307796100027
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakScience Citation Index Expanded (SCI-EXPANDED)en_US
dc.institutionauthorÖnal, Mehmeten_US
dc.institutionauthorid0000-0002-0219-9581
dc.language.isoenen_US
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.publisherElsevier Science BVen_US
dc.relation.ispartofEuropean Journal of Operational Researchen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectInventoryen_US
dc.subjectEconomic lot sizingen_US
dc.subjectDynamic programmingen_US
dc.subjectTimeen_US
dc.subjectInventory boundsen_US
dc.subjectInventory levelsen_US
dc.subjectLot sizingen_US
dc.subjectLot sizing problemsen_US
dc.subjectLower and upper boundsen_US
dc.subjectOptimal solutionsen_US
dc.subjectMathematical modelsen_US
dc.subjectOperations researchen_US
dc.subjectAlgorithmsen_US
dc.subjectLot sizingen_US
dc.subjectProduction controlen_US
dc.subjectCapacitated loten_US
dc.titleA note on "The economic lot sizing problem with inventory bounds"en_US
dc.typeArticleen_US
dspace.entity.typePublication

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
432.pdf
Boyut:
292.71 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Publisher's Version
İndir

Koleksiyon

Makale Koleksiyonu | Endüstri Mühendisliği Bölümü
Scopus İndeksli Yayınlar Koleksiyonu
WoS İndeksli Yayınlar Koleksiyonu