Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (Q2564755)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 967173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low-complexity algorithms for sequencing jobs with a fixed number of job-classes |
scientific article; zbMATH DE number 967173 |
Statements
Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (English)
0 references
15 January 1997
0 references
makespan
0 references
parallel machines
0 references
identical processing times
0 references
0 references
0.7850858569145203
0 references
0.7796579599380493
0 references
0.7784770727157593
0 references
0.7781524062156677
0 references
