Complexity results for flow-shop scheduling problems with transportation delays and a single robot (Q2895091)
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 6051927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for flow-shop scheduling problems with transportation delays and a single robot |
scientific article; zbMATH DE number 6051927 |
Statements
2 July 2012
0 references
flow-shop scheduling problem
0 references
complexity results
0 references
transportation delay
0 references
single robot
0 references
Complexity results for flow-shop scheduling problems with transportation delays and a single robot (English)
0 references
0.921908438205719
0 references
0.8835222721099854
0 references
0.8799641132354736
0 references