Optimizing planned maintenance graphs for collections of engineering network sections

DOI10.1134/S0005117910090067MaRDI QIDQ544682zbMATH OpenOpenAlexFDO

Authors A. A. Krygin

Publication date 16 June 2011

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117910090067

zbMATH Keywords

mathematical modelingoptimal repairs schedule, Weibull distribution

Mathematics Subject Classification ID

Optimal stochastic control (93E20)

Recommendations

• Properties of graphs of problems network planning and management
• A dynamic discrete network design problem for maintenance planning in traffic networks
• Optimizing infrastructure network maintenance when benefits are interdependent
• Capacitated planned maintenance. Models, optimization algorithms, combinatorial and polyhedral properties
• Analysis of multiechelon maintenance network characteristics using implicit enumeration algorithm
• Dynamic maintenance of planar digraphs, with applications
• scientific article; zbMATH DE number 3904510
• Graph optimization and network optimization
• Multi-period maintenance scheduling of tree networks with minimum flow disruption

Cites work

• Algorithms for optimization of the number of switchings in heat supply networks reconfiguration
• An Automatic Method of Solving Discrete Programming Problems
• Estimating state and operation of power supply systems

Cited in

(1)

• Optimizing infrastructure network maintenance when benefits are interdependent

This page was built for publication: Optimizing planned maintenance graphs for collections of engineering network sections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q544682)