A branch-and-check approach for a wind turbine maintenance scheduling problem
From MaRDI portal
Publication:1651530
DOI10.1016/j.cor.2017.07.001zbMath1391.90643OpenAlexW2733925309MaRDI QIDQ1651530
Jorge E. Mendoza, Michel Gendreau, Louis-Martin Rousseau, Aurélien Froger, Éric Pinson
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.07.001
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach, Branch-and-check approaches for the tourist trip design problem with rich constraints, Logic-Based Benders Decomposition for Large-Scale Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Maintenance scheduling in the electricity industry: a literature review
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Precoloring extension. I: Interval graphs
- Logic-based Benders decomposition
- A fast algorithm for the maximum clique problem
- Optimisation of maintenance routing and scheduling for offshore wind farms
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Benders Decomposition for Production Routing Under Demand Uncertainty
- Algorithm 457: finding all cliques of an undirected graph
