Routing open shop and flow shop scheduling problems (Q421573)
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 6035036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Routing open shop and flow shop scheduling problems |
scientific article; zbMATH DE number 6035036 |
Statements
Routing open shop and flow shop scheduling problems (English)
0 references
14 May 2012
0 references
scheduling
0 references
routing
0 references
open shop
0 references
flow shop
0 references
complexity
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9091970920562744
0 references
0.8975745439529419
0 references
0.8910272121429443
0 references
0.8906266093254089
0 references
0.886675238609314
0 references
