Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191)
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 7637041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine flow-shop scheduling to minimize total late work: revisited |
scientific article; zbMATH DE number 7637041 |
Statements
Two-machine flow-shop scheduling to minimize total late work: revisited (English)
0 references
23 December 2022
0 references
late work
0 references
flow shop
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.855981171131134
0 references
0.8551824688911438
0 references
0.8373277187347412
0 references
0.8371391892433167
0 references
0.833038866519928
0 references
