Operating Room (Re)Scheduling with Bed Management via ASP

• URL: http://arxiv.org/abs/2105.02283v1
• Date: Wed, 5 May 2021 18:51:22 GMT
• Title: Operating Room (Re)Scheduling with Bed Management via ASP
• Authors: Carmine Dodaro, Giuseppe Galat\`a, Muhammad Kamran Khan, Marco Maratea, Ivan Porro
• Abstract summary: We first present a solution to the problem based on Answer Set Programming (ASP) The solution is tested on benchmarks with realistic sizes and parameters, on three scenarios for the target length on 5-day scheduling. We also present an ASP solution for the rescheduling problem, i.e. when the off-line schedule cannot be completed for some reason.
• Score: 8.189696720657247
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Operating Room Scheduling (ORS) problem is the task of assigning patients to operating rooms, taking into account different specialties, lengths and priority scores of each planned surgery, operating room session durations, and the availability of beds for the entire length of stay both in the Intensive Care Unit and in the wards. A proper solution to the ORS problem is of primary importance for the healthcare service quality and the satisfaction of patients in hospital environments. In this paper we first present a solution to the problem based on Answer Set Programming (ASP). The solution is tested on benchmarks with realistic sizes and parameters, on three scenarios for the target length on 5-day scheduling, common in small-medium sized hospitals, and results show that ASP is a suitable solving methodology for the ORS problem in such setting. Then, we also performed a scalability analysis on the schedule length up to 15 days, which still shows the suitability of our solution also on longer plan horizons. Moreover, we also present an ASP solution for the rescheduling problem, i.e. when the off-line schedule cannot be completed for some reason. Finally, we introduce a web framework for managing ORS problems via ASP that allows a user to insert the main parameters of the problem, solve a specific instance, and show results graphically in real-time. Under consideration in Theory and Practice of Logic Programming (TPLP).

Related papers

• Improving ASP-based ORS Schedules through Machine Learning Predictions [4.215267357325546]
  The Operating Room Scheduling (ORS) problem deals with the optimization of daily operating room surgery schedules.<n>It is a challenging problem subject to many constraints, like to determine the starting time of different surgeries and allocate the required resources.<n>We employ machine learning algorithms to predict the surgery duration, from historical data, to compute provisional schedules.
  arXiv  Detail & Related papers  (2025-07-22T10:56:46Z)
• The ASP-based Nurse Scheduling System at the University of Yamanashi Hospital [0.5624791703748108]
  We present the design principles of a nurse scheduling system built using Answer Set Programming (ASP)<n>Nurse scheduling is a complex optimization problem requiring the reconciliation of individual nurse preferences with hospital staffing needs across various wards.<n>This paper details the practical application of ASP to address these challenges at the University of Yamanashi Hospital.
  arXiv  Detail & Related papers  (2025-06-16T15:25:06Z)
• A Decision Support System for daily scheduling and routing of home healthcare workers with a lunch break consideration [0.0]
  This study examines a home healthcare scheduling and routing problem (HHSRP) with a lunch break requirement. The objective is to minimize both travel distance in a route and unvisited patient (penalty) cost. We developed an effective Adaptive Large Neighborhood Search algorithm to provide high-quality solutions in a short amount of time.
  arXiv  Detail & Related papers  (2024-11-22T16:18:09Z)
• Clairvoyance: A Pipeline Toolkit for Medical Time Series [95.22483029602921]
  Time-series learning is the bread and butter of data-driven *clinical decision support* Clairvoyance proposes a unified, end-to-end, autoML-friendly pipeline that serves as a software toolkit. Clairvoyance is the first to demonstrate viability of a comprehensive and automatable pipeline for clinical time-series ML.
  arXiv  Detail & Related papers  (2023-10-28T12:08:03Z)
• When MOE Meets LLMs: Parameter Efficient Fine-tuning for Multi-task Medical Applications [57.342772288710044]
  We propose a novel parameter efficient fine-tuning framework for multi-task medical applications, dubbed as MOELoRA. For unifying MOE and LoRA, we devise multiple experts as the trainable parameters, where each expert consists of a pair of low-rank matrices to retain the small size of trainable parameters. We conduct experiments on a multi-task medical dataset, indicating MOELoRA outperforms the existing parameter efficient fine-tuning methods.
  arXiv  Detail & Related papers  (2023-10-21T17:18:09Z)
• Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling [2.370481325034443]
  In Answer Set Programming (ASP) the user can define declaratively a problem and solve it with efficient solvers. In other research areas, Logic-Based Benders Decomposition (LBBD) proved effective. In this paper, we apply for the first time LBBD to ASP, exploiting an application in health care as case study.
  arXiv  Detail & Related papers  (2023-05-19T19:34:47Z)
• Conjunctive Query Based Constraint Solving For Feature Model Configuration [79.14348940034351]
  We show how to apply conjunctive queries to solve constraint satisfaction problems. This approach allows the application of a wide-spread database technology to solve configuration tasks.
  arXiv  Detail & Related papers  (2023-04-26T10:08:07Z)
• A Hierarchical Temporal Planning-Based Approach for Dynamic Hoist Scheduling Problems [11.66506213335498]
  Hoist scheduling has become a bottleneck in electroplating industry applications with the development of autonomous devices. We formulate the hoist scheduling problem as a new temporal planning problem in the form of adapted PDDL. We provide a collection of real-life benchmark instances that can be used to evaluate solution methods for the problem.
  arXiv  Detail & Related papers  (2022-12-11T05:30:44Z)
• Optimal Event Monitoring through Internet Mashup over Multivariate Time Series [77.34726150561087]
  This framework supports the services of model definitions, querying, parameter learning, model evaluations, data monitoring, decision recommendations, and web portals. We further extend the MTSA data model and query language to support this class of problems for the services of learning, monitoring, and recommendation.
  arXiv  Detail & Related papers  (2022-10-18T16:56:17Z)
• Planning and Scheduling in Digital Health with Answer Set Programming [0.0]
  Problems in the healthcare are complex since to solve them several constraints and different type of resources should be taken into account. We plan to propose solutions to these kind of problems both expanding already tested solutions and by modelling solutions for new problems.
  arXiv  Detail & Related papers  (2022-08-05T10:51:02Z)
• The Contextual Appointment Scheduling Problem [4.644923443649425]
  We formulate ASP as an Integrated Estimation and Optimization problem using a task-based loss function. We justify the use of contexts by showing that not including the them yields to inconsistent decisions, which translates to sub-optimal appointments.
  arXiv  Detail & Related papers  (2021-08-12T04:51:26Z)
• An ASP-based Solution to the Chemotherapy Treatment Scheduling problem [7.633618497843278]
  The problem of scheduling chemotherapy treatments in oncology clinics is a complex problem. We first consider a specific instance of the problem which is employed in the San Martino Hospital in Genova, Italy, and present a solution to the problem based on Answer Set Programming (ASP) Results of an experimental analysis, conducted on the real data provided by the San Martino Hospital, show that ASP is an effective solving methodology also for this important scheduling problem.
  arXiv  Detail & Related papers  (2021-08-05T14:18:45Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints [52.58352707495122]
  We present a multi-robot allocation algorithm that decouples the key computational challenges of sequential decision-making under uncertainty and multi-agent coordination. We validate our results over a wide range of simulations on two distinct domains: multi-arm conveyor belt pick-and-place and multi-drone delivery dispatch in a city.
  arXiv  Detail & Related papers  (2020-05-27T01:10:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.