A total tardiness problem with preprocessing included (Q5687645)
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 958304
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A total tardiness problem with preprocessing included |
scientific article; zbMATH DE number 958304 |
Statements
21 January 1997
0 references
two-machine flow-shop total tardiness problem
0 references
average job completion time
0 references
branch-and-bound
0 references
polynomial-time heuristic
0 references
A total tardiness problem with preprocessing included (English)
0 references
0.8321815729141235
0 references
0.8129590153694153
0 references
0.8108772039413452
0 references
0.7931528091430664
0 references
0.7931201457977295
0 references
