An assignment-based lower bound for a class of two-machine flow shop problems (Q336351)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An assignment-based lower bound for a class of two-machine flow shop problems |
scientific article; zbMATH DE number 6650415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An assignment-based lower bound for a class of two-machine flow shop problems |
scientific article; zbMATH DE number 6650415 |
Statements
An assignment-based lower bound for a class of two-machine flow shop problems (English)
0 references
10 November 2016
0 references
flow shop
0 references
linear assignment
0 references
total completion times
0 references
total tardiness
0 references
0 references
0 references
0 references
0.8358706831932068
0 references
0.8356958627700806
0 references
0.8352068066596985
0 references
0.8330469131469727
0 references
