Scheduling eJournal最新文献

Advance Admission Scheduling via Resource Satisficing 通过资源满足提前入场安排

Scheduling eJournal Pub Date : 2019-12-30 DOI: 10.2139/ssrn.3394845

Minglong Zhou, Melvyn Sim, Lam Shao Wei

{"title":"Advance Admission Scheduling via Resource Satisficing","authors":"Minglong Zhou, Melvyn Sim, Lam Shao Wei","doi":"10.2139/ssrn.3394845","DOIUrl":"https://doi.org/10.2139/ssrn.3394845","url":null,"abstract":"We study the problem of advance scheduling of ward admission requests in a public hospital, which affects the usage of critical resources such as operating theaters and hospital beds. Given the stochastic arrivals of patients and their uncertain usage of resources, it is often infeasible for the planner to devise a risk-free schedule to meet these requests without violating resource capacity constraints and creating negative effects that include healthcare overtime, longer patient waiting times, and even bed shortages. The difficulty of quantifying these costs and the need to safeguard against their overutilization lead us to propose a resource satisficing framework that renders the violation of resource constraints less likely and also diminishes their impact whenever they occur. The risk of resource overutilization is captured by our resource satisficing index (RSI), which is inspired by Aumann and Serrano (2008) riskiness index and is calibrated to coincide with the expected utilization rate when the random resource usage corresponds to some referenced probability distribution commonly associated with the type of resource. RSI, unlike the expected utilization rate, is risk sensitive and could better mitigate the risks of overutilization. Our satisficing approach aims to balance out the overutilization risks by minimizing the largest RSIs among all resources and time periods, which, under our proposed partial adaptive scheduling policy, can be formulated and solved via a converging sequence of mixed-integer optimization problems. A computational study establishes that our approach reduces resource overutilization risks to a greater extent than does the benchmark method using the first fit (FF) heuristics.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121798001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Adaptive Capacity Planning for Ambulatory Surgery Centers 门诊手术中心的适应性容量规划

Scheduling eJournal Pub Date : 2019-09-24 DOI: 10.2139/ssrn.3463408

Seokjun Youn, H. N. Geismar, C. Sriskandarajah, V. Tiwari

{"title":"Adaptive Capacity Planning for Ambulatory Surgery Centers","authors":"Seokjun Youn, H. N. Geismar, C. Sriskandarajah, V. Tiwari","doi":"10.2139/ssrn.3463408","DOIUrl":"https://doi.org/10.2139/ssrn.3463408","url":null,"abstract":"Problem definition: We develop a framework to plan capacity in each of three sequential stages for ambulatory surgery centers (ASCs). The interdependence of activities, their stochastic durations, and the uncertainties in patient-mix pose significant challenges to managing the capacity of each activity and to achieving a smooth patient ow by coordinating the stages for each patient's visit. These strategic and operational decisions must efficiently cover all variations of daily patient demand. The overall objective is to minimize the total cost incurred in satisfying this demand, where the total cost is defined as the sum of the overtime cost and the amortized construction cost for the three stages. Methodology/results: In contrast to the traditional top-down approach to capacity planning, our approach proposes a bottom-up strategy based on optimization methods and data analytics. Specifically, we model ASCs as hybrid ow shops (HFS) from the scheduling literature, then relax the fixed capacity assumption of traditional HFS problems by using the trade-o_ between the overtime cost and the amortized capacity construction cost. Because the HFS is strongly NP-hard, we develop a straightforward and easy to implement heuristic to find cost-efficient capacities for the three stages. Our computational study, informed by operational-level archival patient data, examines how stochastic business parameters, e.g., patient-mix, service durations, and overnight-stay probabilities, affect the capacity planning decision. Managerial implications: Timely capacity adjustment is important for ASC practitioners, but related research is limited. This study highlights the benefit of considering the three stages together for capacity planning, rather than focusing solely on the operating rooms. We expect our approach to guide the more than 5,700 ASCs in the U.S., which perform 23 million surgeries annually, to make appropriate investments that will improve ASC operations via capacity adjustment and patient scheduling.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132813181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Online Advance Scheduling with Overtime: A Primal-Dual Approach 带加班的在线提前调度:一种原始对偶方法

Scheduling eJournal Pub Date : 2019-03-13 DOI: 10.2139/ssrn.3352166

Esmaeil Keyvanshokooh, Cong Shi, M. P. Oyen

{"title":"Online Advance Scheduling with Overtime: A Primal-Dual Approach","authors":"Esmaeil Keyvanshokooh, Cong Shi, M. P. Oyen","doi":"10.2139/ssrn.3352166","DOIUrl":"https://doi.org/10.2139/ssrn.3352166","url":null,"abstract":"Problem definition: We study a fundamental online resource allocation problem in service operations in which a heterogeneous stream of arrivals that varies in service times and rewards makes service requests from a finite number of servers/providers. This is an online adversarial setting in which nothing more is known about the arrival process of customers. Each server has a finite regular capacity but can be expanded at the expense of overtime cost. Upon arrival of each customer, the system chooses both a server and a time for service over a scheduling horizon subject to capacity constraints. The system seeks easy-to-implement online policies that admit a competitive ratio (CR), guaranteeing the worst-case relative performance. Academic/practical relevance: On the academic side, we propose online algorithms with theoretical CRs for the problem described above. On the practical side, we investigate the real-world applicability of our methods and models on appointment-scheduling data from a partner health system. Methodology: We develop new online primal-dual approaches for making not only a server-date allocation decision for each arriving customer, but also an overtime decision for each server on each day within a horizon. We also derive a competitive analysis to prove a theoretical performance guarantee. Results: Our online policies are (i) robust to future information, (ii) easy-to-implement and extremely efficient to compute, and (iii) admitting a theoretical CR. Comparing our online policy with the optimal offline policy, we obtain a CR that guarantees the worst-case performance of our online policy. Managerial implications: We evaluate the performance of our online algorithms by using real appointment scheduling data from a partner health system. Our results show that the proposed online policies perform much better than their theoretical CR, and outperform the pervasive First-Come-First-Served (FCFS) and nested threshold policies (NTPO) by a large margin.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125365442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs 离散到达时间随机预约调度问题的多模块性

Scheduling eJournal Pub Date : 2018-10-26 DOI: 10.1287/MNSC.2018.3242

Christos Zacharias, Tallys H. Yunes

引用次数: 34

Scheduling Stability: The Landscape of Work Schedules and Potential Gains From Fairer Workweeks in Illinois and Chicago 时间安排稳定性:伊利诺伊州和芝加哥工作时间安排的前景和更公平工作周的潜在收益

Scheduling eJournal Pub Date : 2018-04-24 DOI: 10.2139/SSRN.3172354

Alison Dickson, L. Golden, R. Bruno

{"title":"Scheduling Stability: The Landscape of Work Schedules and Potential Gains From Fairer Workweeks in Illinois and Chicago","authors":"Alison Dickson, L. Golden, R. Bruno","doi":"10.2139/SSRN.3172354","DOIUrl":"https://doi.org/10.2139/SSRN.3172354","url":null,"abstract":"Fair Workweek legislation has sprung up organically around the country in response to the prevalence and consequences of work schedules that may be unstable, unpredictable or unreliable. Labor standards need to be updated to deal with the widespread use of last minute, on-call or inadequate work hours, and their adverse consequences for workers. A new survey of 1,717 workers throughout the state of Illinois workers was conducted between October, 2017 – March, 2018, including full-time, part-time and non-standard (e.g., contractor, temp) workers. It oversamples Chicago residents, low and middle income households and hourly paid workers. It uses both online and in-person survey collection methods. Over 40 percent of hourly paid workers have at least occasional on-call work, often with very short advance notice, and almost half have little to no input into their daily work schedules. Over a third of all workers have less than one week’s advance notice of their schedule and almost half have a preference to work more hours for more income. Irregular shift working and hours - underemployment are both higher among part time workers. From the findings, a list of public policy recommendations are offered to address the erratic work schedules and their documented work-life time conflict consequences found here for working people.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116735234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Dynamic Assignment of Patients to Primary and Secondary Inpatient Units: Is Patience a Virtue? 病人在一级和二级住院病房的动态分配:耐心是一种美德吗?

Scheduling eJournal Pub Date : 2016-12-22 DOI: 10.2139/ssrn.2889071

Derya Kilinc, S. Saghafian, S. Traub

{"title":"Dynamic Assignment of Patients to Primary and Secondary Inpatient Units: Is Patience a Virtue?","authors":"Derya Kilinc, S. Saghafian, S. Traub","doi":"10.2139/ssrn.2889071","DOIUrl":"https://doi.org/10.2139/ssrn.2889071","url":null,"abstract":"An important contributor to the well-known problem of Emergency Department (ED) overcrowding is prolonged boarding of patients who are admitted through the ED. Patients admitted through the ED constitute about 50% of all non-obstetrical hospital admissions, and may be boarded in the ED for long hours with the hope of finding an available bed in their primary inpatient unit. We study effective ways of reducing ED boarding times by considering the trade-off between keeping patients in the ED and assigning them to a secondary inpatient unit. The former can increase the risk of adverse events and cause congestion in the ED, whereas the latter may adversely impact the quality of care. Further complicating this calculus is the fact that a secondary inpatient unit for a current patient can be the primary unit for a future arriving patient; assignments, therefore, should be made in an orchestrated way. Developing a queueing-based Markov decision process, we first demonstrate that patience in transferring patients is a virtue, but only up to a point. We also find that, contrary to the prevalent perception, idling inpatient beds can be beneficial. Since the optimal policy for dynamically assigning patients to their primary and secondary inpatient units is complex and hard to implement in hospitals, we develop a simple policy which we term penalty-adjusted Largest Expected Workload Cost (LEWC-p). Using simulation analyses calibrated with hospital data, we find that implementing this policy could significantly help hospitals to improve their patient safety by reducing boarding times while controlling the overflow of patients to secondary units. Using both data analyses and various simulation experiments, we also help managers by generating insights into hospital conditions under which achievable improvements are significant.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116948443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Scheduling of Jobs in the Continuous Casting Stage of Steel Production 钢铁生产连铸阶段作业调度

Scheduling eJournal Pub Date : 2016-12-12 DOI: 10.2139/ssrn.2752514

A. Goel, Oliver Herr

引用次数: 0

Performance Measures Through Benchmarking and Diagnostic Evaluation of Key Result Areas in Industries 通过对行业关键成果领域的基准和诊断性评估来衡量绩效

Scheduling eJournal Pub Date : 2016-06-02 DOI: 10.2139/SSRN.2788466

D. Mahto

引用次数: 0

Home Care Routing and Appointment Scheduling with Stochastic Service Durations 随机服务时间下的居家护理路径与预约安排

Scheduling eJournal Pub Date : 2015-10-02 DOI: 10.2139/ssrn.2668769

Y. Zhan, Zizhuo Wang, Guohua Wan

{"title":"Home Care Routing and Appointment Scheduling with Stochastic Service Durations","authors":"Y. Zhan, Zizhuo Wang, Guohua Wan","doi":"10.2139/ssrn.2668769","DOIUrl":"https://doi.org/10.2139/ssrn.2668769","url":null,"abstract":"Motivated by a practical problem arising from the home health care industry, we consider an integrated routing and appointment scheduling problem with random service durations. Given a set of patients with known locations and service duration distributions, the health care team is required to visit each location exactly once. The objective of the problem is to determine the visit route and appointment times to minimize the total cost of traveling and idling of the health care team and the cost of waiting of the patients.We formulate the problem as a stochastic mixed integer program (MIP). By exploiting structures of the problem, we propose using an integer L-shaped method to solve the sample average approximation (SAA) version of the problem. New optimality cuts are developed to improve the performance of the method, leading to a much more efficient algorithm than the traditional branch-and-cut algorithm. Furthermore, we propose two approximation methods for solving this problem. The first one uses an inventory approximation idea developed in the recent literature, which only requires the mean and variance information of the service durations. The second one is based on a \"look-one-step-back\" idea and approximates the appointment cost of each patient by only considering the randomness of the service duration at its predecessor. We also conduct numerical experiments to assess the performance of the proposed methods on problems of practical size. The computational results show that both the exact and the approximate methods work very well.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"166 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132758118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

New Results on the Coordination of Transportation and Batching Scheduling 运输与批调度协调的新结果

Scheduling eJournal Pub Date : 2014-08-01 DOI: 10.2139/ssrn.2489050

Hongli Zhu, R. Leus, Hong Zhou

引用次数: 5