Two-machine flowshop scheduling to minimize total tardiness (Q4352599)
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 1057550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine flowshop scheduling to minimize total tardiness |
scientific article; zbMATH DE number 1057550 |
Statements
Two-machine flowshop scheduling to minimize total tardiness (English)
0 references
4 September 1997
0 references
sequencing
0 references
two-machine flowshop
0 references
total tardiness
0 references
branch-and-bound
0 references
precedence relations
0 references
0 references
0 references
0.9547138810157776
0 references
0.9153099656105042
0 references
0.914988100528717
0 references
0.9024949669837952
0 references
