Two-agent scheduling on an unbounded serial batching machine (Q3167645)
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 6101803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent scheduling on an unbounded serial batching machine |
scientific article; zbMATH DE number 6101803 |
Statements
Two-Agent Scheduling on an Unbounded Serial Batching Machine (English)
0 references
2 November 2012
0 references
scheduling
0 references
serial batching machine
0 references
multi-agent
0 references
complexity
0 references
dynamic programming
0 references
0.9252464771270752
0 references
0.9137958288192748
0 references
0.9115676283836364
0 references
0.8994098901748657
0 references
0.8943852186203003
0 references
