Vikas Agrawal, Aber Elsaleiby, Yue Zhang, P S Sundararaghavan, Andrew Casabianca
{"title":"Minimax <i>c</i> <sup>th</sup> percentile of makespan in surgical scheduling.","authors":"Vikas Agrawal, Aber Elsaleiby, Yue Zhang, P S Sundararaghavan, Andrew Casabianca","doi":"10.1080/20476965.2019.1700763","DOIUrl":null,"url":null,"abstract":"<p><p>In this paper, we address the problem of finding an assignment of <i>n</i> surgeries to be performed in one of <i>m</i> parallel identical operating rooms (ORs), given each surgery has a stochastic duration with a known mean and standard deviation. The objective is to minimise the maximum of the <i>c<sup>th</sup></i> percentile of makespan of any OR. We formulate this problem as a nonlinear integer program, and small-sized instances are solved using the GAMS BONMIN solver. We develop a greedy heuristic and a genetic algorithm procedure for solving large-sized instances. Using real data from a major U.S. teaching hospital and benchmarking datasets from the literature, we report on the performance of the heuristics as compared to the GAMS BONMIN solver.</p>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2019-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/20476965.2019.1700763","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/20476965.2019.1700763","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, we address the problem of finding an assignment of n surgeries to be performed in one of m parallel identical operating rooms (ORs), given each surgery has a stochastic duration with a known mean and standard deviation. The objective is to minimise the maximum of the cth percentile of makespan of any OR. We formulate this problem as a nonlinear integer program, and small-sized instances are solved using the GAMS BONMIN solver. We develop a greedy heuristic and a genetic algorithm procedure for solving large-sized instances. Using real data from a major U.S. teaching hospital and benchmarking datasets from the literature, we report on the performance of the heuristics as compared to the GAMS BONMIN solver.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.