ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

维修优化×动态规划×
领域可靠性优化
方法族Process / pipelineProcess / pipeline
起源年份20021957
提出者Hongzhou WangRichard Bellman
类型decision optimization frameworkExact combinatorial optimization via recursive decomposition
开创性文献Wang, H. (2002). A survey of maintenance policies of deteriorating systems. European Journal of Operational Research, 139(3), 469–489. DOI ↗Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6
别名Optimal Maintenance Policy, Preventive Maintenance Scheduling, Predictive Maintenance Optimization, Bakım OptimizasyonuDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
相关33
摘要Maintenance Optimization is a quantitative framework for determining the timing, type, and frequency of maintenance actions—preventive, predictive, or corrective—that minimize total cost or expected downtime over a system's operational life. Systematic formulations were consolidated by Hongzhou Wang (2002), whose survey unified age-replacement, block-replacement, and imperfect-repair policies under a common cost-rate structure applicable to deteriorating systems across engineering and operations management.Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure.
ScholarGate数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 Download slides

ScholarGate方法对比: Maintenance Optimization · Dynamic Programming. 于 2026-06-15 检索自 https://scholargate.app/zh/compare