Note on minimizing total tardiness in a two-machine flowshop (Q2387308)
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 2201664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on minimizing total tardiness in a two-machine flowshop |
scientific article; zbMATH DE number 2201664 |
Statements
Note on minimizing total tardiness in a two-machine flowshop (English)
0 references
2 September 2005
0 references
Sequencing
0 references
Branch-and-bound
0 references
Flowshop scheduling
0 references
0 references
0.901199460029602
0 references
0.8932531476020813
0 references
0.8678315877914429
0 references
0.8663798570632935
0 references
0.8632436394691467
0 references
