Determining the optimal order quantity with compound Erlang demand under \((T, Q)\) policy (Q1721165)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Determining the optimal order quantity with compound Erlang demand under \((T, Q)\) policy |
scientific article; zbMATH DE number 7019236
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining the optimal order quantity with compound Erlang demand under \((T, Q)\) policy |
scientific article; zbMATH DE number 7019236 |
Statements
Determining the optimal order quantity with compound Erlang demand under \((T, Q)\) policy (English)
0 references
8 February 2019
0 references
Summary: Management of electric equipment has a direct impact on companies' performance and profitability. Considering the critical role that electric power materials play in supporting maintenance operations and preventing equipment failure, it is essential to maintain an inventory to a reasonable level. However, a majority of these electric power materials exhibit an intermittent demand pattern characterized by random arrivals interspersed with time periods with no demand at all. These characteristics cause additional difficulty for companies in managing these electric power material inventories. In response to the above problem, this paper, based on the electric power material demand data of Shanghai Electric Power Company, develops a new method to determine the optimal order quantity \(Q^\ast\) in a cost-oriented periodic review \((T, Q)\) system, whereby unsatisfied demands are backordered and demand follows a compound Erlang distribution. \(Q^\ast\) corresponds to the value of \(Q\) that gives the minimum expected total inventory holding and backordering cost. Subsequently, an empirical investigation is conducted to compare this method with the Newsvendor model. Results verify its superiority in cost savings. Ultimately, considering the complicated calculation and low efficiency of that algorithm, this paper proposes an approximation and a heuristic algorithm which have a higher level of utility in a real industrial context. The approximation algorithm simplifies the calculation process by reducing iterative times while the heuristic algorithm achieves it by generalizing the relationship between the optimal order quantity \(Q^\ast\) and mean demand interarrival rate \(\lambda \).
0 references
0 references
0 references
0 references
0 references