Pages that link to "Item:Q5432691"
From MaRDI portal
The following pages link to Parallel variable neighbourhood search algorithms for job shop scheduling problems (Q5432691):
Displaying 17 items.
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems (Q1687632) (← links)
- Variable neighborhood search: basics and variants (Q1707084) (← links)
- Variable neighbourhood search and mathematical programming for just-in-time job-shop scheduling problem (Q1718383) (← links)
- General variable neighborhood search for the data mule scheduling problem (Q1791917) (← links)
- A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
- Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking (Q2627356) (← links)
- MPI parallelization of variable neighborhood search (Q2840781) (← links)
- Parallelization strategies for bee colony optimization based on message passing communication protocol (Q2868923) (← links)
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem (Q3163164) (← links)
- Parallel Variable Neighborhood Search (Q3424832) (← links)
- MULTIPROCESSOR INTERCONNECTION NETWORKS WITH SMALL TIGHTNESS (Q3646175) (← links)
- A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization (Q4909103) (← links)
- Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling (Q5302318) (← links)
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search (Q5432690) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
