File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/00207540500218967
- Scopus: eid_2-s2.0-30844466431
- WOS: WOS:000233129800002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Optimal inventory control of lumpy demand items using ( s , S ) policies with a maximum issue quantity restriction and opportunistic replenishments
Title | Optimal inventory control of lumpy demand items using ( s , S ) policies with a maximum issue quantity restriction and opportunistic replenishments |
---|---|
Authors | |
Keywords | Inventory Control Lumpy Demand Items Maximum Issue Quantity Opportunistic Replenishment |
Issue Date | 2005 |
Publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp |
Citation | International Journal Of Production Research, 2005, v. 43 n. 23, p. 4929-4944 How to Cite? |
Abstract | This paper presents a modified ( s , S ) inventory model which describes the characteristics of an inventory system with lumpy demand items. A maximum issue quantity restriction of w units and a critical inventory position of A units are incorporated into the inventory control policy. Customer orders with demand sizes larger than the maximum issue quantity will be filtered out from the inventory system and satisfied by using special replenishment orders in order to avoid disruption to the inventory system. The option of opportunistic replenishments is introduced to further minimize the total replenishment cost. An opportunistic replenishment is initiated if the level of the current inventory position is equal to or below the critical level when a customer demand with a size exceeding the maximum issue quantity arrives, which does not only initiate a direct shipment to the customer, but also raises the inventory position to S . Two effective algorithms are developed to determine the optimal values of w , A , s and S simultaneously. The first algorithm is based on the branch-and-bound tree search technique, and the second one is based on the concept of genetic algorithms. Numerical examples are used to illustrate the effectiveness of the algorithms developed. The effects of changes in the cost and system parameters on the optimal inventory control policy are also studied by using sensitivity analysis. |
Persistent Identifier | http://hdl.handle.net/10722/155882 |
ISSN | 2023 Impact Factor: 7.0 2023 SCImago Journal Rankings: 2.668 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hollier, RH | en_US |
dc.contributor.author | Mak, KL | en_US |
dc.contributor.author | Yiu, KFC | en_US |
dc.date.accessioned | 2012-08-08T08:38:10Z | - |
dc.date.available | 2012-08-08T08:38:10Z | - |
dc.date.issued | 2005 | en_US |
dc.identifier.citation | International Journal Of Production Research, 2005, v. 43 n. 23, p. 4929-4944 | en_US |
dc.identifier.issn | 0020-7543 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155882 | - |
dc.description.abstract | This paper presents a modified ( s , S ) inventory model which describes the characteristics of an inventory system with lumpy demand items. A maximum issue quantity restriction of w units and a critical inventory position of A units are incorporated into the inventory control policy. Customer orders with demand sizes larger than the maximum issue quantity will be filtered out from the inventory system and satisfied by using special replenishment orders in order to avoid disruption to the inventory system. The option of opportunistic replenishments is introduced to further minimize the total replenishment cost. An opportunistic replenishment is initiated if the level of the current inventory position is equal to or below the critical level when a customer demand with a size exceeding the maximum issue quantity arrives, which does not only initiate a direct shipment to the customer, but also raises the inventory position to S . Two effective algorithms are developed to determine the optimal values of w , A , s and S simultaneously. The first algorithm is based on the branch-and-bound tree search technique, and the second one is based on the concept of genetic algorithms. Numerical examples are used to illustrate the effectiveness of the algorithms developed. The effects of changes in the cost and system parameters on the optimal inventory control policy are also studied by using sensitivity analysis. | en_US |
dc.language | eng | en_US |
dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp | en_US |
dc.relation.ispartof | International Journal of Production Research | en_US |
dc.subject | Inventory Control | en_US |
dc.subject | Lumpy Demand Items | en_US |
dc.subject | Maximum Issue Quantity | en_US |
dc.subject | Opportunistic Replenishment | en_US |
dc.title | Optimal inventory control of lumpy demand items using ( s , S ) policies with a maximum issue quantity restriction and opportunistic replenishments | en_US |
dc.type | Article | en_US |
dc.identifier.email | Mak, KL:makkl@hkucc.hku.hk | en_US |
dc.identifier.email | Yiu, KFC:cedric@hkucc.hku.hk | en_US |
dc.identifier.authority | Mak, KL=rp00154 | en_US |
dc.identifier.authority | Yiu, KFC=rp00206 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1080/00207540500218967 | en_US |
dc.identifier.scopus | eid_2-s2.0-30844466431 | en_US |
dc.identifier.hkuros | 119269 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-30844466431&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 43 | en_US |
dc.identifier.issue | 23 | en_US |
dc.identifier.spage | 4929 | en_US |
dc.identifier.epage | 4944 | en_US |
dc.identifier.isi | WOS:000233129800002 | - |
dc.publisher.place | United Kingdom | en_US |
dc.identifier.scopusauthorid | Hollier, RH=6602740286 | en_US |
dc.identifier.scopusauthorid | Mak, KL=7102680226 | en_US |
dc.identifier.scopusauthorid | Yiu, KFC=24802813000 | en_US |
dc.identifier.citeulike | 386966 | - |
dc.identifier.issnl | 0020-7543 | - |