Maintenance scheduling problems as benchmarks for constraint algorithms (Q1978021)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maintenance scheduling problems as benchmarks for constraint algorithms |
scientific article; zbMATH DE number 1456920
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maintenance scheduling problems as benchmarks for constraint algorithms |
scientific article; zbMATH DE number 1456920 |
Statements
Maintenance scheduling problems as benchmarks for constraint algorithms (English)
0 references
7 June 2000
0 references
search algorithm
0 references
scheduling
0 references
0.87930626
0 references
0.87400234
0 references
0.87363803
0 references
0.87247366
0 references
0.8711014
0 references
0.8700081
0 references
0.86276954
0 references
0.86041385
0 references
0.85945314
0 references
