Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm |
scientific article; zbMATH DE number 7153687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm |
scientific article; zbMATH DE number 7153687 |
Statements
Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (English)
0 references
20 January 2020
0 references
sequencing
0 references
scheduling
0 references
A* algorithm
0 references
beam search
0 references
particle therapy patient scheduling
0 references
0 references
0 references
0 references
0 references
0.820527970790863
0 references
0.7134771347045898
0 references
0.713306188583374
0 references
0.7032743096351624
0 references
