: Karin Möllering
: Inventory Rationing A New Modeling Approach Using Markov Chain Theory
: Springer Gabler
: 9783658242558
: 1
: CHF 38.00
:
: Allgemeines, Lexika
: English
: 188
: Wasserzeichen/DRM
: PC/MAC/eReader/Tablet
: PDF
The last decades have seen an increasing diversity of customer expectations and growing competitive pressure for a wide variety of industries. Customer segmentation and subsequent inventory rationing provide a way to cope with those customer demands while maintaining a competitive offer. The general idea resembles the yield management practised in the airline or hotel industries: Demand fulfilment for low priority customers might be refused or delayed in order to reserve stock for more important clients.

div>This dissertation thesis from Karin Möllering provides a comprehensive introduction to inventory rationing. It gives an overview of the different approaches studied and identifies state-of-the-art rules. In a second step, the book particularly focuses on an easy-to-implement but highly efficient rationing strategy. For this strategy, a mathematical model is developed that allows for optimization under different objectives.

Potential readership includes scholars of inventory control and management science, students interested in these areas as well as practitioners involved in formulating and implementing rationing strategies.


Karin Möllering published her work with Kölner Wissenschaftsverlag until 2018.
Contents8
List of Tables14
List of Figures16
List of Abbreviations18
List of Symbols20
1 Introduction23
1.1 Motivation24
1.2 Research Objectives25
1.3 Outline26
Part I Foundations of Stochastic Inventory Control29
2 Basic Concepts of Inventory Management30
2.1 Inventory Management and Control31
2.2 Motivations for Holding Inventory32
2.3 Classification of Inventories34
2.3.1 The Strategic Perspective34
2.3.2 The Operational Perspective35
2.4 Inventory-related Costs37
2.4.1 Order Cost37
2.4.2 Holding Cost38
2.4.3 Penalty Cost39
2.5 Service Level40
3 Stochastic Inventory Control42
3.1 Characteristics of Inventory Models43
3.1.1 Management Decisions43
3.1.2 System-Inherent Characteristics44
3.2 Types of Inventory Control Policies46
3.3 Periodic Inventory Control48
3.3.1 Single-Period Inventory Control49
3.3.2 Multi-Period Inventory Control50
3.3.3 Service-Constraint Multi-Period Inventory Control53
Part II Essential Stochastic Processes54
4 Markov Chains55
4.1 The Markov Property56
4.2 Homogeneous Markov Chains57
4.3 Limit Distribution and Invariant Distribution58
4.4 Communication Classes60
4.5 Class Properties61
4.5.1 Aperiodicity61
4.5.2 Recurrency and Transiency61
4.5.3 Class Criteria63
4.6 Uniqueness of Limit Distributions64
4.7 Multi-Dimensional Markov Chains65
4.8 Applications of Markov Chains66
5 Numerical Solution of Infinite Markov Chains67
5.1 System Reduction Approaches68
5.1.1 Reduced System Approaches68
5.1.2 Geometric Tail Distributions69
5.2 State Space Reduction Approaches70
5.2.1 Augmentations70
5.2.2 Pointwise Convergence72
5.3 Algorithms74
5.3.1 Sheskin’s Partitioning Algorithm74
5.3.2 Power Iteration76
5.4 Criteria for Choosing a Specific Algorithm76
6 Comparing Stochastic Processes78
6.1 Stochastic Ordering for Distribution Functions78
6.2 The Sample Path Method80
Part III Stochastic Inventory Control with Customer Segmentation82
7 Introduction to Inventory Rationing83
7.1 Examples for Different Customer Classes84
7.2 Related Areas85
7.3 Rationing Rules87
7.4 Backorders and Backorder Clearing Mechanisms89
7.5 Literature Review91
7.5.1 Characterizations of the Optimal Policy91
7.5.2 Evaluations and Optimizations of Critical Level Policies94
7.5.3 Other Studies Involving Critical Level Rationing98
7.6 Classification of Our Work99
8 A Markov-Chain Based Modeling Approach101
8.1 Modeling Framework102
8.2 Recursive Expressions for Backorders102
8.3 Markov Chain104
8.4 Structural Results105
8.5 Proofs108
9 Prioritization by Penalty Costs115
9.1 Optimization Approach116
9.1.1 Convexity of Objective Function116
9.1.2 Transition Matrix118
9.1.3 Cost Function119
9.1.4 Numerical Optimization Algorithm120
9.2 Numerical Results120
9.2.1 Critical Level Policy versus Benchmark Policies121
9.2.2 Combination Heuristic124
9.3 Conclusion124
9.4 Proofs126
10 Prioritization by Service Levels129
10.1 Analytical Insights130
10.1.1 Service Level Constraints130
10.1.2 Potentially Optimal Parameter Constellations133
10.1.3 Structural Results for the Optimal Solution135
10.1.4 Cost Function137
10.1.5 Model Alteration: ?-Service Levels138
10.2 Numerical Results139
10.2.1 Optimization Algorithm140
10.2.2 Critical Level Policy versus Benchmark Policies141
10.2.3 Heuristic Approach144
10.3 Conclusion145
10.4 Proofs147
11 Dynamic Rationing Policies153
11.1 The Next Period Optimization Policy154
11.1.1 The Policy154
11.1.2 Structural results155
11.2 The Linear Critical Level Policy156
11.2.1 The Policy156
11.2.2 Structural results157
11.3 Efficiency of the Dynamic Rationing Policies160
11.3.1 Next Period Optimization and Constant Rationing Policy161
11.3.2 Linear Critical Level Policy and Constant Rationing Policy165
11.3.3 Next Period Optimization and Linear Critical Level Policy168
11.4 Conclusion170
11.5 Proofs171
12 Conclusion and Critical Review174
12.1 Contributions174
12.2 Critical Review176
12.3 Future Research177
Bibliography179