Published: 01 Jan 2024, Last Modified: 14 May 2025Eur. J. Oper. Res. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract:Highlights•We introduce two maintenance scheduling problems.•Proofs of NP-hardness are provided.•We develop exact solution approaches.•Both solution approaches are evaluated in a computational study.