On the complexity of a maintenance problem for hierarchical systems

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2024-05-01 DOI:10.1016/j.orl.2024.107117

Andreas S. Schulz , Claudio Telha

引用次数: 0

Abstract

We prove that a maintenance problem on frequency-constrained maintenance jobs with a hierarchical structure is integer-factorization hard. This result holds even on simple systems with just two components to maintain. As a corollary, we provide a first hardness result for Levi et al.'s modular maintenance scheduling problem (Levi et al. 2014).

查看原文本刊更多论文

论分层系统维护问题的复杂性

我们证明，具有分层结构的频率受限维护工作的维护问题很难整数因子化。即使在只有两个组件需要维护的简单系统上，这一结果也是成立的。作为推论，我们为 Levi 等人的模块化维护调度问题（Levi 等人，2014 年）提供了第一个硬度结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.