Show simple item record

dc.contributor.authorAngalakudati, Mallik
dc.contributor.authorBalwani, Siddharth
dc.contributor.authorCalzada, Jorge
dc.contributor.authorChatterjee, Bikram
dc.contributor.authorPerakis, Georgia
dc.contributor.authorRaad, Nicolas
dc.contributor.authorUichanco, Joline
dc.date.accessioned2015-10-01T18:22:25Z
dc.date.available2015-10-01T18:22:25Z
dc.date.issued2014-04
dc.date.submitted2012-09
dc.identifier.issn0025-1909
dc.identifier.issn1526-5501
dc.identifier.urihttp://hdl.handle.net/1721.1/99121
dc.description.abstractIn this paper, we describe both applied and analytical work in collaboration with a large multistate gas utility. The project addressed a major operational resource allocation challenge that is typical to the industry. We study the resource allocation problem in which some of the tasks are scheduled and known in advance, and some are unpredictable and have to be addressed as they appear. The utility has maintenance crews that perform both standard jobs (each must be done before a specified deadline) as well as respond to emergency gas leaks (that occur randomly throughout the day and could disrupt the schedule and lead to significant overtime). The goal is to perform all the standard jobs by their respective deadlines, to address all emergency jobs in a timely manner, and to minimize maintenance crew overtime. We employ a novel decomposition approach that solves the problem in two phases. The first is a job scheduling phase, where standard jobs are scheduled over a time horizon. The second is a crew assignment phase, which solves a stochastic mixed integer program to assign jobs to maintenance crews under a stochastic number of future emergencies. For the first phase, we propose a heuristic based on the rounding of a linear programming relaxation formulation and prove an analytical worst-case performance guarantee. For the second phase, we propose an algorithm for assigning crews that is motivated by the structure of an optimal solution. We used our models and heuristics to develop a decision support tool that is being piloted in one of the utility's sites. Using the utility's data, we project that the tool will result in a 55% reduction in overtime hours.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CMMI-1162034)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CMMI-0824674)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CMMI-0758061)en_US
dc.language.isoen_US
dc.publisherInstitute for Operations Research and the Management Sciences (INFORMS)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1287/mnsc.2014.1919en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceOther univ. web domainen_US
dc.titleBusiness Analytics for Flexible Resource Allocation Under Random Emergenciesen_US
dc.typeArticleen_US
dc.identifier.citationAngalakudati, Mallik, Siddharth Balwani, Jorge Calzada, Bikram Chatterjee, Georgia Perakis, Nicolas Raad, and Joline Uichanco. “Business Analytics for Flexible Resource Allocation Under Random Emergencies.” Management Science 60, no. 6 (June 2014): 1552–73.en_US
dc.contributor.departmentSloan School of Managementen_US
dc.contributor.mitauthorBalwani, Siddharthen_US
dc.contributor.mitauthorPerakis, Georgiaen_US
dc.relation.journalManagement Scienceen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsAngalakudati, Mallik; Balwani, Siddharth; Calzada, Jorge; Chatterjee, Bikram; Perakis, Georgia; Raad, Nicolas; Uichanco, Jolineen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-0888-9030
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record