SciELO - Scientific Electronic Library Online

vol.21 número1Forecasting new product salesDevelopment of a more applied version of coherency called 'sensible coherency' for assessment of financial risk measures índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados



Links relacionados

  • En proceso de indezaciónCitado por Google
  • En proceso de indezaciónSimilares en Google


South African Journal of Industrial Engineering

versión On-line ISSN 2224-7890
versión impresa ISSN 1012-277X


YADAVALLI, V.S.S.; ADETUNJI, O.; SIVAKUMAR, B.  y  ARIVARIGNAN, G.. Two-commodity perishable inventory system with bulk demand for one commodity. S. Afr. J. Ind. Eng. [online]. 2010, vol.21, n.1, pp.137-156. ISSN 2224-7890.

This article considers a two-commodity continuous review inventory system in which the arriving customers belong to any one of three types, such that type 1 customers demand a single item of the first commodity, type 2 customers demand bulk items of the second commodity, and type 3 customers demand one item of the first commodity and bulk items of the second commodity. The arrivals of all three types of customers are assumed to be a Markovian arrival process (MAP). It is also assumed that the number of items demanded for the second commodity is a random variable. The ordering policy is to place orders for both commodities when the inventory levels are below prefixed levels for both commodities. The lead time is assumed to have a phase type distribution, and the demands that occur during stock out period are assumed to be lost. The joint probability distribution for both commodities is obtained in the steady state case. Various measures of system performance and the total expected cost rate in the steady state are derived. The results are illustrated with numerical examples.

        · resumen en Africano     · texto en Inglés     · Inglés ( pdf )


Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons