Pages that link to "Item:Q1978021"
From MaRDI portal
The following pages link to Maintenance scheduling problems as benchmarks for constraint algorithms (Q1978021):
Displaying 7 items.
- A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
- Probe backtrack search for minimal perturbation in dynamic scheduling (Q1591427) (← links)
- Ship maintenance scheduling by genetic algorithm and constraint-based reasoning (Q1806661) (← links)
- Solving the weighted capacitated planned maintenance problem and its variants (Q1991204) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- A non-binary constraint ordering heuristic for constraint satisfaction problems (Q2425983) (← links)
- Generating effective symmetry-breaking predicates for search problems (Q2741511) (← links)