On the complexity of a maintenance problem for hierarchical systems

DOI10.1016/J.ORL.2024.107117MaRDI QIDQ6988646zbMATH OpenFDO

Authors Andreas S. Schulz, Claudio Telha

Publication date 3 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107117

zbMATH Keywords

computational complexityinteger-factorizationmaintenance scheduling

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Abstract computational complexity for mathematical programming problems (90C60) Applications of mathematical programming (90C90)

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A new Rabin-type trapdoor permutation equivalent to factoring
• A review of multi-component maintenance models with economic dependence
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• Computational Complexity
• Integer factorization: Why two-item joint replenishment is hard
• Maintenance scheduling for modular systems: modeling and algorithms
• Optimal clustering of frequency-constrained maintenance jobs with shared set-ups

This page was built for publication: On the complexity of a maintenance problem for hierarchical systems

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