Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063)
From MaRDI portal
!
WARNING
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 6589630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints |
scientific article; zbMATH DE number 6589630 |
Statements
Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (English)
0 references
6 June 2016
0 references
chance-constrained programming
0 references
service scheduling
0 references
mixed integer linear programming
0 references
decomposition
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0.7605147957801819
0 references
0.7584996819496155
0 references
0.7576500177383423
0 references
0.7550966739654541
0 references
