Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints

Title
Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
Authors
Keywords
Chance-constrained programming, Service scheduling , Mixed-integer linear programming, Decomposition, Branch-and-cut, 90C15 Stochastic programming, 90C10 Integer programming
Journal
MATHEMATICAL PROGRAMMING
Volume 157, Issue 1, Pages 245-276
Publisher
Springer Nature
Online
2016-02-23
DOI
10.1007/s10107-016-0990-x

Ask authors/readers for more resources

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now