Variable neighborhood search for the pharmacy duty scheduling problem (Q337137)
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: Variable neighborhood search for the pharmacy duty scheduling problem |
scientific article; zbMATH DE number 6650713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Variable neighborhood search for the pharmacy duty scheduling problem |
scientific article; zbMATH DE number 6650713 |
Statements
Variable neighborhood search for the pharmacy duty scheduling problem (English)
0 references
10 November 2016
0 references
pharmacy duty scheduling
0 references
variable neighborhood search
0 references
variable neighborhood restricted search
0 references
variable neighborhood decomposition search
0 references
PDS
0 references
VNS
0 references
VNRS
0 references
VNDS
0 references
0 references
0 references
0 references
0.8436969518661499
0 references
0.8036284446716309
0 references
0.7827848792076111
0 references
0.7582280039787292
0 references
0.7555748224258423
0 references
