Pages that link to "Item:Q5955476"
From MaRDI portal
The following pages link to Fast parallel heuristics for the job shop scheduling problem (Q5955476):
Displaying 7 items.
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- On single-walk parallelization of the job shop problem solving algorithms (Q1761161) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- A fine-grained parallel algorithm for the cyclic flexible job shop problem (Q4971705) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)