Two-machine flow-shop scheduling problems with minimizing the total completion times (Q4924332)
From MaRDI portal
!
WARNING
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 6169009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine flow-shop scheduling problems with minimizing the total completion times |
scientific article; zbMATH DE number 6169009 |
Statements
31 May 2013
0 references
flow-shop scheduling problem
0 references
total completion time worst-case
0 references
single server
0 references
0.9138109087944032
0 references
0.8845092058181763
0 references
0.8673793077468872
0 references
0.8667904734611511
0 references
0.8667904734611511
0 references
