A note on the complexity of flow shop scheduling with transportation constraints (Q859706)
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 5116401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of flow shop scheduling with transportation constraints |
scientific article; zbMATH DE number 5116401 |
Statements
A note on the complexity of flow shop scheduling with transportation constraints (English)
0 references
16 January 2007
0 references
scheduling
0 references
flow shop
0 references
transportation
0 references
complexity
0 references
0.9716448
0 references
0.9566922
0 references
0.92374504
0 references
0.9133779
0 references
0.89588493
0 references
0.89142585
0 references
