New complexity results on scheduling problem in a robotic cell (Q4603936)
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 6842845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New complexity results on scheduling problem in a robotic cell |
scientific article; zbMATH DE number 6842845 |
Statements
New complexity results on scheduling problem in a robotic cell (English)
0 references
23 February 2018
0 references
flowshop
0 references
complexity
0 references
makespan
0 references
dynamic algorithm
0 references
tranportation
0 references
0 references
0 references
0.9274019
0 references
0.92441916
0 references
0.9096624
0 references
0.90280515
0 references
0.8975781
0 references
0.89368117
0 references
0.89150727
0 references
0.88807636
0 references
