Nested general variable neighborhood search for the periodic maintenance problem

DOI10.1016/j.ejor.2016.01.014zbMath1346.90392OpenAlexW2279587276MaRDI QIDQ322899

Saïd Hanafi, Abdelhakim Artiba, Nenad Mladenović, Rachid Benmansour, Raca Todosijević

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.01.014

zbMATH Keywords

schedulingvariable neighborhood searchmixed-integer linear programmingpreventive maintenancenested general VNS

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (6)

Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ General variable neighborhood search approach to group Steiner tree problem ⋮ Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Variable neighborhood search: basics and variants ⋮ Solving the weighted capacitated planned maintenance problem and its variants

Cites Work

• Variable neighbourhood search: methods and applications
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• Variable neighbourhood search: Methods and applications
• Integrating maintenance and production decisions in a hierarchical production planning environment
• Variable neighborhood search
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs
• Modeling and solving the periodic maintenance problem
• New variable neighbourhood search based 0-1 MIP heuristics
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• Variable neighborhood search: Principles and applications

This page was built for publication: Nested general variable neighborhood search for the periodic maintenance problem