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.
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview