Spelling suggestions: "subject:"inventory iatromathematical models."" "subject:"inventory introducemathematical models.""
1 
Optimal (s,S) policies for inventory systems with a maximum issue quantity restriction黎錦強, Lai, Kamkeung. January 1995 (has links)
published_or_final_version / Industrial and Manufacturing Systems Engineering / Doctoral / Doctor of Philosophy

2 
An inventory model with stochastic leadtime, partial shipment, and delivery information delay.January 2005 (has links)
Xie Lei. / Thesis (M.Phil.)Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 5053). / Abstracts in English and Chinese. / Chapter 1  Introduction  p.1 / Chapter 1.1  Related Literature  p.2 / Chapter 2  Notations and Model Formulation  p.8 / Chapter 3  The Optimal Replenishment Policy  p.15 / Chapter 3.1  Preliminaries  p.15 / Chapter 3.2  The optimal replenishment policy at the second decision point  p.17 / Chapter 3.3  The optimal replenishment policy at the first decision point  p.19 / Chapter 4  Specialized Case: No Delivery Information Delay Model  p.21 / Chapter 4.1  Special Case 1: The Realized Proportional Factor rt = 0  p.23 / Chapter 4.2  Special Case 2: The Realized Proportional Factor rt = 1  p.23 / Chapter 4.3  Comparison of the Two Special Cases  p.24 / Chapter 4.4  "The Case with Partial Delivery (rt e (0,1))"  p.26 / Chapter 4.5  Comparison of the Delivery Information Delay Model and the No Delivery Information Delay Model  p.33 / Chapter 5  Nonoptimality of a BaseStock Policy in Numerical Examples  p.36 / Chapter 6  Conclusion and Future Work  p.39 / Chapter 6.1  Conclusion  p.39 / Chapter 6.2  Future Work  p.40 / Chapter 7  Appendix  p.42

3 
Analysis of inventory systems with demands met either from inventory or by special deliveries林志立, Lam, Chilap. January 1988 (has links)
published_or_final_version / Industrial Engineering / Master / Master of Philosophy

4 
Applicability of deterministic inventory models to solve stochastic inventory systemsMedina Benatuil, Orlando Enrique 08 1900 (has links)
No description available.

5 
Single item inventory models for backorders and lost salesKeswani, Ajit Kumar 12 1900 (has links)
No description available.

6 
Measures of effectiveness for selected inventory policies under stochastic processesNewberry, Thomas Levy 05 1900 (has links)
No description available.

7 
Solution approaches to the stochastic multiitem inventory system under a joint order constraintCoblentz, François 05 1900 (has links)
No description available.

8 
An interactive goal programming approach to multiitem inventory systemsGarrido, Octavio Bruce 05 1900 (has links)
No description available.

9 
A Monte Carlo experimental investigation of the effect of multipleitem orders on inventory costsMiley, Clarence Calmore 08 1900 (has links)
No description available.

10 
Structured policies for complex production and inventory modelsSun, Daning January 1990 (has links)
For inventory models minimizing the longrun average cost over an infinite horizon, the existence of optimal policies was an open question for a long time. Consider a deterministic, continuous time inventory system satisfies the following conditions: the production network is acyclic, the joint setup cost function is monotone, the holding cost and the backlogging cost rates are nonnegative, the demand rates are constant over time, the production rates are infinite or finite nonincreasing, and backlogging may be allowed or not. For this very general extension of the WilsonHarris EOQ model, we prove the existence of optimal policies. Very few properties of optimal policies have been discovered since the 1950's. Restricting the above inventory model to infinite production rates, we present some new properties of optimal policies, such as the Latest Ordering Property, and explicit expressions for echelon inventories and order quantities in terms of ordering instants.
An assembly production system with n facilities has a constant external demand occurring at the end facility. Production rates at each facility are finite and nonincreasing along any path in the assembly network. Associated with each facility are a setup cost and positive echelon holding cost rate. The formulation of the lotsizing problem is developed in terms of integerratio lot size policies. This formulation provides a unification of the integersplit policies formulation of Schwarz and Schrage [34] (1975) and the integermultiple policies formulation of Moily [20] (1986), allowing either assumption to be operative at any point in the system. A relaxed solution to this unified formulation provides a lower bound to the cost of any feasible policy. The derivation of this Lower Bound Theorem is novel and relies on the notion of path holding costs, a generalization of echelon holding costs. An optimal poweroftwo lot size policy is found by an 0(n³ log n) algorithm and its cost is within 2% of the optimum in the worst case.
Mitchell [18] (1987) extended Roundy's 98%effectiveness results for onewarehouse multiretailer inventory systems with backlogging. We extend this 98%effectiveness result
for series inventory systems with backlogging. The nearlyintegerratio policies still work. The continuous relaxation provides a lower bound on the longrun average cost of any feasible policy. The backlogging model is also reduced in 0{n) time to an equivalent model without backlogging. Roundy's results [27] (1983) are then applied for finding a 98%effective backlogging policy in O(nlogn) time.
In an EOQ model with n products, joint setup costs provide incentives for joint replenishment. These joint setup costs may be modelled as a positive, nondecreasing, submodular set function. A grouping heuristic partitions the n products into groups, and all products in the same group are always jointly replenished. Each group is then considered as a single "aggregate product" being replenished independently of the other groups, and therefore according to the EOQ formula. As a result, possible savings when several groups are simultaneously replenished are simply ignored. Our main result is that the cost of the best such grouping solution cannot be worse than 44.8% above the optimum cost. Known examples show that it can be as bad as 22.4% above the optimum cost. These results contrast with earlier results for poweroftwo policies, the best of which never being worse than about 2% above the optimum cost. / Business, Sauder School of / Graduate

Page generated in 0.0997 seconds