Integrated capacity and inventory management with capacity acquisition lead times
European Journal of Operational Research
949 - 958
MetadataShow full item record
Mincsovics, G., Tan, T., & Alp, O. (2009). Integrated capacity and inventory management with capacity acquisition lead times. European Journal of Operational Research, 196(3), 949-958.
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/11682
We model a make-to-stock production system that utilizes permanent and contingent capacity to meet non-stationary stochastic demand, where a constant lead time is associated with the acquisition of contingent capacity. We determine the structure of the optimal solution concerning both the operational decisions of integrated inventory and flexible capacity management, and the tactical decision of determining the optimal permanent capacity level. Furthermore, we show that the inventory (either before or after production), the pipeline contingent capacity, the contingent capacity to be ordered, and the permanent capacity are economic substitutes. We also show that the stochastic demand variable and the optimal contingent capacity acquisition decisions are economic complements. Finally, we perform numerical experiments to evaluate the value of utilizing contingent capacity and to study the effects of capacity acquisition lead time, providing useful managerial insights. (C) 2008 Elsevier B.V. All rights reserved.
Showing items related by title, author, creator and subject.
Mincsovics G.; Tan, T.; Alp O. (2009)We model a make-to-stock production system that utilizes permanent and contingent capacity to meet non-stationary stochastic demand, where a constant lead time is associated with the acquisition of contingent capacity. We ...
Arikan, E. (1994)We present an upper bound on the zero-error list-coding capacity of discrete memory less channels. Using this bound, we show that the list-3 capacity of the 4/3 channel is at most 03512 b, improving the best previous bound. ...
Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels Arikan, E. (2009)A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity is the highest ...