Effective heuristics for the single machine sequencing problem with ready times (Q3352822)
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 4204099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Effective heuristics for the single machine sequencing problem with ready times |
scientific article; zbMATH DE number 4204099 |
Statements
Effective heuristics for the single machine sequencing problem with ready times (English)
0 references
1991
0 references
single machine sequencing
0 references
different ready times
0 references
mean completion time
0 references
heuristics
0 references
branch and bound
0 references
0 references
0 references
0.9018822
0 references
0.8843617
0 references
0.8814591
0 references
0.8808309
0 references
0 references
0.8796935
0 references
0.87748015
0 references
0.8767151
0 references
0.8724113
0 references
