Benchmarks for basic scheduling problems (Q2366085)
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: Benchmarks for basic scheduling problems |
scientific article; zbMATH DE number 223239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Benchmarks for basic scheduling problems |
scientific article; zbMATH DE number 223239 |
Statements
Benchmarks for basic scheduling problems (English)
0 references
29 June 1993
0 references
benchmarks
0 references
randomly generated scheduling problems
0 references
industrial problems
0 references
permutation flow shop
0 references
job shop
0 references
open shop
0 references
makespan
0 references
0.8997922539710999
0 references
0.8267486691474915
0 references
0.8002381920814514
0 references
0.799748420715332
0 references
