Computational approximations of renewal process relating to a warranty problem: The case of phase-type lifetimes

Author： Kao E.P.C.   Smith M.S.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.90, Iss.1, 1996-04, pp. : 156-170

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Discrete NT-policy single server queue with Markovian arrival process and phase type service

By Alfa A.S.   Frigui I.  

European Journal of Operational Research, Vol. 88, Iss. 3, 1996-02 ,pp. : 599-613

Elsevier

Access to resources Recommend Favorite

The process of problem-formulation

By Bowen K.  

European Journal of Operational Research, Vol. 128, Iss. 2, 2001-01 ,pp. : 258-265

Elsevier

Access to resources Recommend Favorite

Approximations for the departure process of the G/G/1 queue with Markov-modulated arrivals

By Girish M.K.   Hu J.-Q.  

European Journal of Operational Research, Vol. 134, Iss. 3, 2001-11 ,pp. : 540-556

Elsevier

Access to resources Recommend Favorite

Computational experience with approximation algorithms for the set covering problem

By Grossman T.   Wool A.  

European Journal of Operational Research, Vol. 101, Iss. 1, 1997-08 ,pp. : 81-92

Elsevier

Access to resources Recommend Favorite

A computational study of smoothing heuristics for the traveling salesman problem

By Coy S.P.   Golden B.L.   Wasil E.A.  

European Journal of Operational Research, Vol. 124, Iss. 1, 2000-07 ,pp. : 15-27

Elsevier

Access to resources Recommend Favorite