Nested general variable neighborhood search for the periodic maintenance problem
DOI10.1016/J.EJOR.2016.01.014zbMATH Open1346.90392OpenAlexW2279587276MaRDI QIDQ322899FDOQ322899
Authors: Raca Todosijević, R. Ben-Mansour, Saïd Hanafi, Nenad Mladenović, Abdelhakim Artiba 
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
Recommendations
- A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance
- A general framework for nested variable neighborhood search
- A generalized variable neighborhood search for combinatorial optimization problems
- A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance
- General variable neighborhood search for the continuous optimization
- A variable neighborhood search heuristic for periodic routing problems
- A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities
- Variable neighborhood search: Principles and applications
schedulingpreventive maintenancevariable neighborhood searchmixed-integer linear programmingnested general VNS
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)
Cites Work
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Modeling and solving the periodic maintenance problem
- Integrating maintenance and production decisions in a hierarchical production planning environment
- 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
- New variable neighborhood search based 0-1 MIP heuristics
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
Cited In (13)
- Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost
- Solving the weighted capacitated planned maintenance problem and its variants
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations
- General variable neighborhood search approach to group Steiner tree problem
- New search algorithm for solving the maintenance scheduling problem for a family of machines
- Variable neighborhood search: the power of change and simplicity
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
- Minimization of maximum lateness on parallel machines with a single server and job release dates
- Variable neighborhood search: basics and variants
- A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption
- Modeling and solving the periodic maintenance problem
- A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation
This page was built for publication: Nested general variable neighborhood search for the periodic maintenance problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322899)
