Business Analytics for Flexible Resource Allocation Under Random Emergencies

References

• Ahmed S (2010) Two-stage stochastic integer programming: A brief introduction. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science, Vol. 8 (John Wiley & Sons, New York).Google Scholar
• Birge JR (1997) Stochastic programming computation and applications. INFORMS J. Comput. 9(2):111–133.Link, Google Scholar
• Burke G (2010) Aging gas pipe at risk of explosion nationwide. AP News Archive (September 14), http://www.apnewsarchive.com/2010/Aging-gas-pipe-at-risk-of-explosion-nationwide/id-d3e64ab3509a445285f27f4f81f73e4c.Google Scholar
• Erdős P, Lovász L (1975) Problems and results on 3-chromatic hypergraphs and some related questions. Hajnal A, Rado R, Sós VT, eds. Infinite and Finite Sets: To Paul Erdős on His 60th Birthday, Vol. 2 (North-Holland, Amsterdam), 609–628.Google Scholar
• Glass CA, Kellerer H (2007) Parallel machine scheduling with job assignment restrictions. Naval Res. Logist. 54(3):250–257.Crossref, Google Scholar
• Godfrey G, Powell WB (2002) An adaptive, dynamic programming algorithm for stochastic resource allocation problems, I: Single period travel times. Transportation Sci. 36(1):21–39.Link, Google Scholar
• Huh WT, Liu N, Truong V-A (2013) Multiresource allocation scheduling in dynamic environments. Manufacturing Service Oper. Management 15(2):280–291.Link, Google Scholar
• Hwang H-C, Chang SY, Lee K (2004) Parallel machine scheduling under a grade of service provision. Comput. Oper. Res. 31(12):2055–2061.Crossref, Google Scholar
• Kafura DG, Shen VY (1977) Task scheduling on a multiprocessor system with independent memories. SIAM J. Comput. 6(1):167–187.Crossref, Google Scholar
• Lamiri M, Xie X, Dolgui A, Grimaud F (2008) A stochastic model for operating room planning with elective and emergency demand for surgery. Eur. J. Oper. Res. 185(3):1026–1037.Crossref, Google Scholar
• Laporte G, Louveaux FV (1993) The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3):133–142.Crossref, Google Scholar
• Lenstra JK, Shmoys DB, Tardos E (1990) Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46(1–3):259–271.Crossref, Google Scholar
• McDiarmid C (1989) On the method of bounded differences. Surveys in Combinatorics (Cambridge University Press, Cambridge, UK), 148–188.Crossref, Google Scholar
• Ou J, Leung JY-T, Li C-L (2008) Scheduling parallel machines with inclusive processing set restrictions. Naval Res. Logist. 55(4):328–338.Crossref, Google Scholar
• Pinedo M, Weiss G (1979) Scheduling stochastic tasks on two parallel processors. Naval Res. Logist. Quart. 26(3):527–536.Crossref, Google Scholar
• Pinedo ML (2002) Scheduling: Theory, Algorithms, and Systems, 2nd ed. (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Pipeline and Hazardous Materials Safety Administration (2011) Facts and stats—Pacific Gas and Electric pipeline rupture in San Bruno, CA. Accessed July 16, 2012, http://opsweb.phmsa.dot.gov/pipelineforum/facts-and-stats/recent-incidents/sanbruno-ca.Google Scholar
• Sherali HD, Fraticelli BMP (2002) A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse. J. Global Optim. 22(1–4):319–342.Crossref, Google Scholar
• Weber RR (1982) Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flow time. J. Appl. Probab. 19(1):167–182.Crossref, Google Scholar