File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal inventory control of lumpy demand items using genetic algorithms

TitleOptimal inventory control of lumpy demand items using genetic algorithms
Authors
KeywordsInventory control
Lumpy demand
Cutoffpolicy
Optimal (s,S) policy
Genetic algorithms
Issue Date1999
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/cie
Citation
Computers And Industrial Engineering, 1999, v. 37 n. 1, p. 273-276 How to Cite?
AbstractThis paper is concerned with the optimal control of inventory items which experience lumpy demands. A mathematical model is developed for the determination of optimal replenishment policies for such items. In order to avoid disrupting the inventory system, a maximum issue quantity of w units is specified such that customer orders with sizes exceeding w units will be filtered out of the inventory system and treated as special orders to be satisfied by placing special replenishment orders to a supplier. Customer orders with sizes less than or equal to w units will be met from stock. A genetic search algorithm is developed to solve the problem. The theoretical results obtained are illustrated with a numerical example.
Persistent Identifierhttp://hdl.handle.net/10722/74328
ISSN
2015 Impact Factor: 2.086
2015 SCImago Journal Rankings: 1.630
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorMak, KLen_HK
dc.contributor.authorWong, YSen_HK
dc.contributor.authorHuang, GQen_HK
dc.date.accessioned2010-09-06T07:00:15Z-
dc.date.available2010-09-06T07:00:15Z-
dc.date.issued1999en_HK
dc.identifier.citationComputers And Industrial Engineering, 1999, v. 37 n. 1, p. 273-276en_HK
dc.identifier.issn0360-8352en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74328-
dc.description.abstractThis paper is concerned with the optimal control of inventory items which experience lumpy demands. A mathematical model is developed for the determination of optimal replenishment policies for such items. In order to avoid disrupting the inventory system, a maximum issue quantity of w units is specified such that customer orders with sizes exceeding w units will be filtered out of the inventory system and treated as special orders to be satisfied by placing special replenishment orders to a supplier. Customer orders with sizes less than or equal to w units will be met from stock. A genetic search algorithm is developed to solve the problem. The theoretical results obtained are illustrated with a numerical example.en_HK
dc.languageengen_HK
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/cieen_HK
dc.relation.ispartofComputers and Industrial Engineeringen_HK
dc.subjectInventory control-
dc.subjectLumpy demand-
dc.subjectCutoffpolicy-
dc.subjectOptimal (s,S) policy-
dc.subjectGenetic algorithms-
dc.titleOptimal inventory control of lumpy demand items using genetic algorithmsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0360-8352&volume=37&issue=1-2&spage=273&epage=276&date=1999&atitle=Optimal+inventory+control+of+lumpy+demand+items+using+genetic+algorithmsen_HK
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_HK
dc.identifier.emailHuang, GQ:gqhuang@hkucc.hku.hken_HK
dc.identifier.authorityMak, KL=rp00154en_HK
dc.identifier.authorityHuang, GQ=rp00118en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/S0360-8352(99)00072-8en_HK
dc.identifier.scopuseid_2-s2.0-0032599543en_HK
dc.identifier.hkuros46824en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0032599543&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume37en_HK
dc.identifier.issue1en_HK
dc.identifier.spage273en_HK
dc.identifier.epage276en_HK
dc.identifier.isiWOS:000081364300062-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridMak, KL=7102680226en_HK
dc.identifier.scopusauthoridWong, YS=26637607500en_HK
dc.identifier.scopusauthoridHuang, GQ=7403425048en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats