General variable neighborhood search for the data mule scheduling problem
From MaRDI portal
Recommendations
- Very large-scale variable neighborhood search for the generalized assignment problem
- Gaussian variable neighborhood search for the file transfer scheduling problem
- General variable neighborhood search for the order batching and sequencing problem
- General variable neighborhood search for the parallel machine scheduling problem with two common servers
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
- A generalized variable neighborhood search for combinatorial optimization problems
- Parallel variable neighbourhood search algorithms for job shop scheduling problems
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
Cited in
(3)
This page was built for publication: General variable neighborhood search for the data mule scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1791917)