View in EDS

ASP-based approaches for solving the nuclear medicine scheduling problem.

Saved in:
Bibliographic Details
Title: ASP-based approaches for solving the nuclear medicine scheduling problem.
Authors: Dodaro, Carmine1 (AUTHOR), Galatà, Giuseppe2 (AUTHOR), Maratea, Marco1 (AUTHOR), Marte, Cinzia1 (AUTHOR), Mochi, Marco3 (AUTHOR)
Source: Journal of Logic & Computation. Mar2026, Vol. 36 Issue 2, p1-28. 28p.
Subjects: Scheduling, Logic programming, Medical appointments, Decomposition method, Resource allocation, Problem solving
Abstract: The Nuclear Medicine Scheduling (NMS) problem consists of assigning patients to a day, on which the patient will undergo the medical check, the preparation and the actual image detection process. The schedule should consider the different requirements of the patients and the available resources, e.g. varying time required for different diseases and radiopharmaceuticals used, number of injection chairs and tomographs available. In this paper, we present two solutions to the NMS problem based on Answer Set Programming (ASP). The first solution is a direct ASP encoding, which is then processed by an ASP solver, while the second solution employs a Logic-based Bender Decomposition (LBBD) approach implemented through the usage of multi-shot solving. Experiments employing real data show that the direct encoding provides overall satisfying results in terms of solutions quality in a relatively short time, and that the LBBD approach also helps in improving scalability. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 192182665
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: ASP-based approaches for solving the nuclear medicine scheduling problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Dodaro%2C+Carmine%22">Dodaro, Carmine</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Galatà%2C+Giuseppe%22">Galatà, Giuseppe</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Maratea%2C+Marco%22">Maratea, Marco</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Marte%2C+Cinzia%22">Marte, Cinzia</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Mochi%2C+Marco%22">Mochi, Marco</searchLink><relatesTo>3</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Mar2026, Vol. 36 Issue 2, p1-28. 28p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Scheduling%22">Scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+programming%22">Logic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Medical+appointments%22">Medical appointments</searchLink><br /><searchLink fieldCode="DE" term="%22Decomposition+method%22">Decomposition method</searchLink><br /><searchLink fieldCode="DE" term="%22Resource+allocation%22">Resource allocation</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The Nuclear Medicine Scheduling (NMS) problem consists of assigning patients to a day, on which the patient will undergo the medical check, the preparation and the actual image detection process. The schedule should consider the different requirements of the patients and the available resources, e.g. varying time required for different diseases and radiopharmaceuticals used, number of injection chairs and tomographs available. In this paper, we present two solutions to the NMS problem based on Answer Set Programming (ASP). The first solution is a direct ASP encoding, which is then processed by an ASP solver, while the second solution employs a Logic-based Bender Decomposition (LBBD) approach implemented through the usage of multi-shot solving. Experiments employing real data show that the direct encoding provides overall satisfying results in terms of solutions quality in a relatively short time, and that the LBBD approach also helps in improving scalability. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=192182665
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/logcom/exaf071
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 28
        StartPage: 1
    Subjects:
      – SubjectFull: Scheduling
        Type: general
      – SubjectFull: Logic programming
        Type: general
      – SubjectFull: Medical appointments
        Type: general
      – SubjectFull: Decomposition method
        Type: general
      – SubjectFull: Resource allocation
        Type: general
      – SubjectFull: Problem solving
        Type: general
    Titles:
      – TitleFull: ASP-based approaches for solving the nuclear medicine scheduling problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Dodaro, Carmine
      – PersonEntity:
          Name:
            NameFull: Galatà, Giuseppe
      – PersonEntity:
          Name:
            NameFull: Maratea, Marco
      – PersonEntity:
          Name:
            NameFull: Marte, Cinzia
      – PersonEntity:
          Name:
            NameFull: Mochi, Marco
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 0955792X
          Numbering:
            – Type: volume
              Value: 36
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Journal of Logic & Computation
              Type: main
ResultId 1