Efficient Cloud Server Deployment Under Demand Uncertainty
Author
Abstract
Suggested Citation
DOI: 10.1287/msom.2023.0372
Download full text from publisher
References listed on IDEAS
- Hanan Luss, 1982. "Operations Research and Capacity Expansion Problems: A Survey," Operations Research, INFORMS, vol. 30(5), pages 907-947, October.
- Jeremy A. Bloom & Michael Caramanis & Leonid Charny, 1984. "Long-Range Generation Planning Using Generalized Benders' Decomposition: Implementation and Experience," Operations Research, INFORMS, vol. 32(2), pages 290-313, April.
- Jiankun Sun & Jan A. Van Mieghem, 2019. "Robust Dual Sourcing Inventory Management: Optimality of Capped Dual Index Policies and Smoothing," Manufacturing & Service Operations Management, INFORMS, vol. 21(4), pages 912-931, October.
- Alper Atamtürk & Muhong Zhang, 2007. "Two-Stage Robust Network Flow and Design Under Demand Uncertainty," Operations Research, INFORMS, vol. 55(4), pages 662-673, August.
- Shi Chen & Kamran Moinzadeh & Jing-Sheng Song & Yuan Zhong, 2023. "Cloud Computing Value Chains: Research from the Operations Management Perspective," Manufacturing & Service Operations Management, INFORMS, vol. 25(4), pages 1338-1356, July.
- Tolga Tezcan & Banafsheh Behzad, 2012. "Robust Design and Control of Call Centers with Flexible Interactive Voice Response Systems," Manufacturing & Service Operations Management, INFORMS, vol. 14(3), pages 386-401, July.
- Sagnik Das & R. Ravi & Srinath Sridhar, 2023. "Order Fulfillment Under Pick Failure in Omnichannel Ship-From-Store Programs," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 508-523, March.
- J. N. Hooker, 2007. "Planning and Scheduling by Logic-Based Benders Decomposition," Operations Research, INFORMS, vol. 55(3), pages 588-602, June.
- Philippe Artzner & Freddy Delbaen & Jean‐Marc Eber & David Heath, 1999. "Coherent Measures of Risk," Mathematical Finance, Wiley Blackwell, vol. 9(3), pages 203-228, July.
- Noah Gans & Haipeng Shen & Yong-Pin Zhou & Nikolay Korolev & Alan McCord & Herbert Ristock, 2015. "Parametric Forecasting and Stochastic Programming Models for Call-Center Workforce Scheduling," Manufacturing & Service Operations Management, INFORMS, vol. 17(4), pages 571-588, October.
- Yossiri Adulyasak & Jean-François Cordeau & Raf Jans, 2015. "Benders Decomposition for Production Routing Under Demand Uncertainty," Operations Research, INFORMS, vol. 63(4), pages 851-867, August.
- Anshul Sheopuri & Ganesh Janakiraman & Sridhar Seshadri, 2010. "New Policies for the Stochastic Inventory Control Problem with Two Supply Sources," Operations Research, INFORMS, vol. 58(3), pages 734-745, June.
- Jeremy A. Bloom, 1983. "Solving an Electricity Generating Capacity Expansion Planning Problem by Generalized Benders' Decomposition," Operations Research, INFORMS, vol. 31(1), pages 84-100, February.
- Dimitris Bertsimas & Ebrahim Nasrabadi & Sebastian Stiller, 2013. "Robust and Adaptive Network Flows," Operations Research, INFORMS, vol. 61(5), pages 1218-1242, October.
- Gary D. Eppen & R. Kipp Martin & Linus Schrage, 1989. "OR Practice—A Scenario Approach to Capacity Planning," Operations Research, INFORMS, vol. 37(4), pages 517-527, August.
- Mohammad Ebrahim Arbabian & Shi Chen & Kamran Moinzadeh, 2021. "Capacity Expansions with Bundled Supplies of Attributes: An Application to Server Procurement in Cloud Computing," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 191-209, 1-2.
- Lemaréchal, C. & Nemirovskii, A. & Nesterov, Y., 1995. "New variants of bundle methods," LIDAM Reprints CORE 1166, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Kibaek Kim & Sanjay Mehrotra, 2015. "A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management," Operations Research, INFORMS, vol. 63(6), pages 1431-1451, December.
- Dale McDaniel & Mike Devine, 1977. "A Modified Benders' Partitioning Algorithm for Mixed Integer Programming," Management Science, INFORMS, vol. 24(3), pages 312-319, November.
- Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
- Aliakbari Sani, Sajad & Bahn, Olivier & Delage, Erick, 2022. "Affine decision rule approximation to address demand response uncertainty in smart Grids’ capacity planning," European Journal of Operational Research, Elsevier, vol. 303(1), pages 438-455.
- Müllerklein, Daniel & Fontaine, Pirmin, 2025. "Resilient transportation network design with disruption uncertainty and lead times," European Journal of Operational Research, Elsevier, vol. 322(3), pages 827-840.
- Clautiaux, François & Ljubić, Ivana, 2025. "Last fifty years of integer linear programming: A focus on recent practical advances," European Journal of Operational Research, Elsevier, vol. 324(3), pages 707-731.
- Nathan Sudermann‐Merx & Steffen Rebennack & Christian Timpe, 2021. "Crossing Minimal Edge‐Constrained Layout Planning using Benders Decomposition," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3429-3447, October.
- N. Beheshti Asl & S. A. MirHassani, 2019. "Accelerating benders decomposition: multiple cuts via multiple solutions," Journal of Combinatorial Optimization, Springer, vol. 37(3), pages 806-826, April.
- Kiho Seo & Seulgi Joung & Chungmok Lee & Sungsoo Park, 2022. "A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2804-2827, September.
- Munoz, F.D. & Hobbs, B.F. & Watson, J.-P., 2016. "New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints," European Journal of Operational Research, Elsevier, vol. 248(3), pages 888-898.
- Zhouchun Huang & Qipeng P. Zheng & Andrew L. Liu, 2022. "A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1919-1939, July.
- Pavlo Glushko & Csaba I. Fábián & Achim Koberstein, 2022. "An L-shaped method with strengthened lift-and-project cuts," Computational Management Science, Springer, vol. 19(4), pages 539-565, October.
- Teodor Gabriel Crainic & Mike Hewitt & Francesca Maggioni & Walter Rei, 2021. "Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design," Transportation Science, INFORMS, vol. 55(2), pages 414-435, March.
- Xian Yu & Siqian Shen, 2025. "On the Value of Risk-Averse Multistage Stochastic Programming in Capacity Planning," INFORMS Journal on Computing, INFORMS, vol. 37(5), pages 1143-1162, September.
- Nasirian, Araz & Zhang, Lele & Costa, Alysson M. & Abbasi, Babak, 2025. "Multiskilled workforce staffing and scheduling: A logic-based Benders’ decomposition approach," European Journal of Operational Research, Elsevier, vol. 323(1), pages 20-33.
- Zheng Cui & Daniel Zhuoyu Long & Jin Qi & Lianmin Zhang, 2023. "The Inventory Routing Problem Under Uncertainty," Operations Research, INFORMS, vol. 71(1), pages 378-395, January.
- Sabet, Ehsan & Yazdani, Baback & Kian, Ramez & Galanakis, Kostas, 2020. "A strategic and global manufacturing capacity management optimisation model: A Scenario-based multi-stage stochastic programming approach," Omega, Elsevier, vol. 93(C).
- Angelos Georghiou & Angelos Tsoukalas & Wolfram Wiesemann, 2026. "On the Optimality of Affine Decision Rules in Distributionally Robust Optimization," Management Science, INFORMS, vol. 72(2), pages 1456-1471, February.
- Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
- William B. Haskell & Wenjie Huang & Huifu Xu, 2018. "Preference Elicitation and Robust Optimization with Multi-Attribute Quasi-Concave Choice Functions," Papers 1805.06632, arXiv.org.
- Hongmin Li & Stephen C. Graves & Woonghee Tim Huh, 2014. "Optimal Capacity Conversion for Product Transitions Under High Service Requirements," Manufacturing & Service Operations Management, INFORMS, vol. 16(1), pages 46-60, February.
- Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormsom:v:27:y:2025:i:2:p:425-440. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/a/inm/ormsom/v27y2025i2p425-440.html