Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.07143 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909896247607296 |
|---|---|
| author | Dionísio, João Gleixner, Ambros Pedroso, João Pedro Bestuzheva, Ksenia |
| author_facet | Dionísio, João Gleixner, Ambros Pedroso, João Pedro Bestuzheva, Ksenia |
| contents | This paper proposes a mixed-integer nonlinear programming approach for joint scheduling of long-term maintenance decisions and short-term production for groups of complex machines with multiple interacting components. We introduce an abstract model where the production and the condition of machines are described by convex functions, allowing the model to be employed for various application areas fitting the scheme. We develop a branch-and-price algorithm to solve this problem, enhanced with acceleration techniques to find primal solutions and reduce the number of pricing rounds. An experimental comparison of this approach to solving the compact formulation directly demonstrates the benefit of the decomposition approach, in particular in larger instances. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_07143 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Branch and price for nonlinear production-maintenance scheduling in complex machinery Dionísio, João Gleixner, Ambros Pedroso, João Pedro Bestuzheva, Ksenia Optimization and Control This paper proposes a mixed-integer nonlinear programming approach for joint scheduling of long-term maintenance decisions and short-term production for groups of complex machines with multiple interacting components. We introduce an abstract model where the production and the condition of machines are described by convex functions, allowing the model to be employed for various application areas fitting the scheme. We develop a branch-and-price algorithm to solve this problem, enhanced with acceleration techniques to find primal solutions and reduce the number of pricing rounds. An experimental comparison of this approach to solving the compact formulation directly demonstrates the benefit of the decomposition approach, in particular in larger instances. |
| title | Branch and price for nonlinear production-maintenance scheduling in complex machinery |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2511.07143 |