An ASP-based Solution for Operating Room Scheduling with Beds Management

Dodaro, Carmine; Galatà, Giuseppe; Khan, Muhammad Kamran; Maratea, Marco; Porro, Ivan

doi:10.1007/978-3-030-31095-0_5

Cited by 10 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the Healthcare domain (see, e.g., [3] for a recent survey), the first solved problem was the Nurse Scheduling Problem [4,5,18], where the goal is to create a scheduling for nurses working in hospital units. Then, the problem of assigning operating rooms to patients, denoted as Operating Room Scheduling [16,17], has been treated, and further extended to include bed management [15]. More recent problems include the Chemotherepy Treatment Scheduling problem [14], in which patients are assigned a chair or a bed for their treatments, and the Rehabilitation Scheduling Problem [12], which assigns patients to operators in rehabilitation sessions.…”

Section: Related Workmentioning

confidence: 99%

“…Complex combinatorial problems, possibly involving optimizations, such as the PAC problem, are usually the target applications of AI languages such as Answer Set Programming (ASP). Indeed ASP, thanks to its readability and the availability of efficient solvers [2,10,25,27], has been successfully employed for solving hard combinatorial problems in several research areas, and it has been also employed to solve many scheduling problems [1,4,5,15,16,18,35], also in industrial contexts (see, e.g., [3,20,21,37] for detailed descriptions of ASP applications).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic

Caruso

Galatà²,

Maratea³

et al. 2022

AIxIA 2021 – Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

The problem of scheduling Pre-Operative Assessment Clinic (PAC) consists of assigning patients to a day for the exams needed before a surgical procedure, taking into account patients with different priority levels, due dates, and operators availability. Realizing a satisfying schedule is of upmost importance for a clinic, since delay in PAC can cause delay in the subsequent phases, causing a decrease in patients' satisfaction. In this paper, we divide the problem in two sub-problems: In the first sub-problem patients are assigned to a day taking into account a default list of exams; then, in the second sub-problem, having the actual list of exams needed by each patient, we use the results of the first sub-problem to assign a starting time to each exam. We first present a mathematical formulation for both problems. Then, we present solutions based on Answer Set Programming (ASP): The first solution is a genuine ASP encoding of the sub-problems, while the second introduces domain-specific optimizations. Experiments show that both solutions provide satisfying results in short time, while the second is able to prove optimality faster.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic

Caruso

Galatà²,

Maratea³

et al. 2022

AIxIA 2021 – Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

show abstract

“…An initial assessment of relevant resources has been completed, and a review of relevant publications, data and projects is underway. In addition, collaboration with the Galliera hospital in Genova, Italy, is underway to assist with workforce scheduling and automated planning of the utilisation of operating rooms with scarce resources and equipment (Alviano et al 2018 ; Dodaro and Galatà 2019 ).…”

Section: Overview Of Research Activitiesmentioning

confidence: 99%

The CLAIRE COVID-19 initiative: approach, experiences and recommendations

et al. 2021

Self Cite

View full text Add to dashboard Cite

A volunteer effort by Artificial Intelligence (AI) researchers has shown it can deliver significant research outcomes rapidly to help tackle COVID-19. Within two months, CLAIRE's self-organising volunteers delivered the World's first comprehensive curated repository of COVID-19-related datasets useful for drug-repurposing, drafted review papers on the role CT/X-ray scan analysis and robotics could play, and progressed research in other areas. Given the pace required and nature of voluntary efforts, the teams faced a number of challenges. These offer insights in how better to prepare for future volunteer scientific efforts and large scale, data-dependent AI collaborations in general. We offer seven recommendations on how to best leverage such efforts and collaborations in the context of managing future crises.

show abstract

“…Answer Set Programming (ASP) (Baral, 2003;Gelfond & Kahl, 2014;Lifschitz, 2019) is a declarative knowledge representation formalism that has been applied successfully in a variety of industrial and scientific applications (Erdem et al, 2016;Falkner et al, 2018) such as configuration (Falkner et al, 2016), team building (Ricca et al, 2012), routing , or scheduling (Dodaro et al, 2019).…”

Section: Introductionmentioning

confidence: 99%

Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach

Comploi-Taupe

Friedrich

Schekotihin

et al. 2023

jair

View full text Add to dashboard Cite

Domain-specific heuristics are an essential technique for solving combinatorial problems efficiently. Current approaches to integrate domain-specific heuristics with Answer Set Programming (ASP) are unsatisfactory when dealing with heuristics that are specified non-monotonically on the basis of partial assignments. Such heuristics frequently occur in practice, for example, when picking an item that has not yet been placed in bin packing. Therefore, we present novel syntax and semantics for declarative specifications of domain-specific heuristics in ASP. Our approach supports heuristic statements that depend on the partial assignment maintained during solving, which has not been possible before. We provide an implementation in Alpha that makes Alpha the first lazy-grounding ASP system to support declaratively specified domain-specific heuristics. Two practical example domains are used to demonstrate the benefits of our proposal. Additionally, we use our approach to implement informed search with A*, which is tackled within ASP for the first time. A* is applied to two further search problems. The experiments confirm that combining lazy-grounding ASP solving and our novel heuristics can be vital for solving industrial-size problems.

show abstract

An ASP-based Solution for Operating Room Scheduling with Beds Management

Cited by 10 publications

References 24 publications

An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic

An ASP-Based Approach to Scheduling Pre-operative Assessment Clinic

The CLAIRE COVID-19 initiative: approach, experiences and recommendations

Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach

Contact Info

Product

Resources

About