Optimal strategies for the preventive maintenance of real-time repairable systems

1. Barlow, R.E. and Proschan, F. (1975) Statistical Theory of Reliability and Life Testing, Holt, Rinehart and Winston, N.Y.

   Google Scholar 

2. Gens, G.V. and Levner, E. V. (1978) Approximation algorithms for certain universal problems in scheduling theory. Engineering Cybernetics. Soviet Journal of Computer and Systems Science, 6, 31–36.

   Google Scholar 

3. Granot, D. and Zuckerman, D. (1991). Optimal sequencing and resource allocation in research and development projects. Management Science, 37, 2, 140–156.

   Article  MATH  Google Scholar 

4. Ibarra, O.H. and Kim C.E. (1975) Fast approximation algorithms for the knapsack and sum of subset problems. Journal of ACM, 22, 463–468.

   Article  MATH  MathSciNet  Google Scholar 

5. Kadane, J.B. (1969) Discrete search and the Neyman-Pearson lemma. Journal of Mathematical Analysis and Application, Journal of Mathematical Analysis and Applications, 22, 156–171.

   Article  MathSciNet  Google Scholar 

6. Lawler, E.L. (1979) Fast approximation algorithms for knapsack problems. Mathematics of Operations Research, 4, 339–356

   Article  MATH  MathSciNet  Google Scholar 

7. Levner, E., Vainberg Y., and Zuckerman D. (1993) Optimal sequencing of R&D projects with learning, Presented at the National Meeting-1993 of Operations Research Society of Israel, Naharia, May 9–10.

   Google Scholar 

8. Martello, S. and Toth, P. (1990) Knapsack Problems. Algorithms and Computer Implementations. Wiley, New York.

   MATH  Google Scholar 

9. Sahni, S. (1975) Approximate algorithms for the 0–1 knapsack problem. Journal of ACM, 22, 115–125.

   Article  MATH  MathSciNet  Google Scholar 

10. Zuckerman, D. (1989) Optimal inspection policy for a multi-unit machine. Journal of Applied Probability, 26, 543–551.

    Article  MATH  MathSciNet  Google Scholar 

Download references