Pages that link to "Item:Q666941"
From MaRDI portal
The following pages link to Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941):
Displaying 9 items.
- emili (Q1349766) (← links)
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem (Q2079447) (← links)
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
- A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
- Evaluating the impact of grammar complexity in automatic algorithm design (Q6082176) (← links)