Jian-Jun Wang, Zongli Dai, Jasmine Chang, Jim (Junmin) Shi, Haiguan Liu
{"title":"Robust surgical scheduling for nonoperating room anesthesia (NORA) under surgical duration uncertainty","authors":"Jian-Jun Wang, Zongli Dai, Jasmine Chang, Jim (Junmin) Shi, Haiguan Liu","doi":"10.1111/deci.12584","DOIUrl":null,"url":null,"abstract":"<p><i>Nonoperating room anesthesia</i> (NORA) refers to the practice and administration of anesthesia or sedation outside the <i>operating room</i> (OR), which has been increasingly implemented in practice. The novelty of NORA is to separate the anesthesia preoperative stage from an OR for the sake of saving OR time and improving its efficiency. In this article, we study the scheduling problem for NORA considering both <i>anesthetic rooms</i> (ARs) and <i>operating rooms</i> (ORs) based on ambiguous information about surgical durations. Our goal is to devise a robust and efficient scheduling mechanism for NORA. To address this problem, we develop a two-stage mixed-integer <i>Robust Optimization</i> (RO) model that minimizes the total costs, including the sum of operating costs of opened ORs and ARs, delay cost of surgeries, and overtime cost of ORs. Decisions include the number of ARs and ORs to open, the allocation of patients to ARs and ORs, the sequence of surgeries, and the planned starting time for each surgery. Accordingly, a heuristic algorithm, so-called <i>column-and-constraint generation</i> (C&CG), is developed that renders a desirable performance. Some salient properties of the problem are also discussed. In addition, by leveraging practical data in conjunction with data reported in the extant research, the computational efficacy of the proposed algorithm is verified under various sets of parameters. Our numerical experiments reveal that (1) the implementation of NORA can reduce the OR overtime cost and the waiting time of patients; (2) our proposed <i>Robust Optimization</i> (RO) model possesses stronger robustness and computational efficiency than the <i>distributionally robust model</i> (DRO); and (3) while considering surgical duration uncertainty, the developed scheduling approach outperforms the corresponding deterministic setting in terms of decreasing the total cost and alleviating the surgery delay. Generally, the proposed approach is more adaptive to take the advantage of the surgical duration uncertainty to enhance its efficacy.</p>","PeriodicalId":48256,"journal":{"name":"DECISION SCIENCES","volume":"55 3","pages":"262-280"},"PeriodicalIF":2.8000,"publicationDate":"2022-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"DECISION SCIENCES","FirstCategoryId":"91","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/deci.12584","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0
Abstract
Nonoperating room anesthesia (NORA) refers to the practice and administration of anesthesia or sedation outside the operating room (OR), which has been increasingly implemented in practice. The novelty of NORA is to separate the anesthesia preoperative stage from an OR for the sake of saving OR time and improving its efficiency. In this article, we study the scheduling problem for NORA considering both anesthetic rooms (ARs) and operating rooms (ORs) based on ambiguous information about surgical durations. Our goal is to devise a robust and efficient scheduling mechanism for NORA. To address this problem, we develop a two-stage mixed-integer Robust Optimization (RO) model that minimizes the total costs, including the sum of operating costs of opened ORs and ARs, delay cost of surgeries, and overtime cost of ORs. Decisions include the number of ARs and ORs to open, the allocation of patients to ARs and ORs, the sequence of surgeries, and the planned starting time for each surgery. Accordingly, a heuristic algorithm, so-called column-and-constraint generation (C&CG), is developed that renders a desirable performance. Some salient properties of the problem are also discussed. In addition, by leveraging practical data in conjunction with data reported in the extant research, the computational efficacy of the proposed algorithm is verified under various sets of parameters. Our numerical experiments reveal that (1) the implementation of NORA can reduce the OR overtime cost and the waiting time of patients; (2) our proposed Robust Optimization (RO) model possesses stronger robustness and computational efficiency than the distributionally robust model (DRO); and (3) while considering surgical duration uncertainty, the developed scheduling approach outperforms the corresponding deterministic setting in terms of decreasing the total cost and alleviating the surgery delay. Generally, the proposed approach is more adaptive to take the advantage of the surgical duration uncertainty to enhance its efficacy.
期刊介绍:
Decision Sciences, a premier journal of the Decision Sciences Institute, publishes scholarly research about decision making within the boundaries of an organization, as well as decisions involving inter-firm coordination. The journal promotes research advancing decision making at the interfaces of business functions and organizational boundaries. The journal also seeks articles extending established lines of work assuming the results of the research have the potential to substantially impact either decision making theory or industry practice. Ground-breaking research articles that enhance managerial understanding of decision making processes and stimulate further research in multi-disciplinary domains are particularly encouraged.