Pages that link to "Item:Q322899"
From MaRDI portal
The following pages link to Nested general variable neighborhood search for the periodic maintenance problem (Q322899):
Displaying 13 items.
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Solving the weighted capacitated planned maintenance problem and its variants (Q1991204) (← links)
- Modeling and solving the periodic maintenance problem (Q2488905) (← links)
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption (Q2668648) (← links)
- A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance (Q5380981) (← links)
- New search algorithm for solving the maintenance scheduling problem for a family of machines (Q5475285) (← links)
- General variable neighborhood search approach to group Steiner tree problem (Q6063507) (← links)
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
- A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation (Q6551143) (← links)
- Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost (Q6554602) (← links)
- Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations (Q6568449) (← links)
- Minimization of maximum lateness on parallel machines with a single server and job release dates (Q6614640) (← links)
