View in EDS PDF Full Text

Maximizing the Total Weighted Operating Time for Surgery Scheduling via Linear Program Randomized Rounding Algorithms.

Saved in:
Bibliographic Details
Title: Maximizing the Total Weighted Operating Time for Surgery Scheduling via Linear Program Randomized Rounding Algorithms.
Authors: CHEN, PO-AN1 poanchen@nycu.edu.tw, CHENG, YA-WEN1 cyw7791.iim.mg09@nycu.edu.tw, WU, TSUNG-JUI1 111012912jerry@gmail.com, LIU, TZE-WEI1 mark6184551@gmail.com
Source: Journal of Information Science & Engineering. May2026, Vol. 42 Issue 3, p559-570. 12p.
Subjects: Integer programming, Scheduling, Linear programming, Approximation algorithms, Algorithms
Abstract: A surgery scheduling problem has been characterized by the integer linear program in the previous work. The objective function is to maximize the total weighted operating time of the week, which equivalently minimizes the idle time on the operating rooms (ORs). The constraints ensure that each operation can only be scheduled once and guarantee that the total time spent on all operations for all departments does not exceed the working hour of a day. We propose two randomized linear program rounding algorithms to solve the problem approximately and in this paper finally show their performances in terms of approximation ratios with a bounded probability for infeasibility and with a feasibility guarantee, respectively. We also supplement the analytical result with numerical result from experiments. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Information Science & Engineering is the property of Institute of Information Science, Academia Sinica 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 Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 193961056
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Maximizing the Total Weighted Operating Time for Surgery Scheduling via Linear Program Randomized Rounding Algorithms.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22CHEN%2C+PO-AN%22">CHEN, PO-AN</searchLink><relatesTo>1</relatesTo><i> poanchen@nycu.edu.tw</i><br /><searchLink fieldCode="AR" term="%22CHENG%2C+YA-WEN%22">CHENG, YA-WEN</searchLink><relatesTo>1</relatesTo><i> cyw7791.iim.mg09@nycu.edu.tw</i><br /><searchLink fieldCode="AR" term="%22WU%2C+TSUNG-JUI%22">WU, TSUNG-JUI</searchLink><relatesTo>1</relatesTo><i> 111012912jerry@gmail.com</i><br /><searchLink fieldCode="AR" term="%22LIU%2C+TZE-WEI%22">LIU, TZE-WEI</searchLink><relatesTo>1</relatesTo><i> mark6184551@gmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Information+Science+%26+Engineering%22">Journal of Information Science & Engineering</searchLink>. May2026, Vol. 42 Issue 3, p559-570. 12p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Integer+programming%22">Integer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Scheduling%22">Scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+programming%22">Linear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Approximation+algorithms%22">Approximation algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A surgery scheduling problem has been characterized by the integer linear program in the previous work. The objective function is to maximize the total weighted operating time of the week, which equivalently minimizes the idle time on the operating rooms (ORs). The constraints ensure that each operation can only be scheduled once and guarantee that the total time spent on all operations for all departments does not exceed the working hour of a day. We propose two randomized linear program rounding algorithms to solve the problem approximately and in this paper finally show their performances in terms of approximation ratios with a bounded probability for infeasibility and with a feasibility guarantee, respectively. We also supplement the analytical result with numerical result from experiments. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Information Science & Engineering is the property of Institute of Information Science, Academia Sinica 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=193961056
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.6688/JISE.202605_42(3).0004
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 559
    Subjects:
      – SubjectFull: Integer programming
        Type: general
      – SubjectFull: Scheduling
        Type: general
      – SubjectFull: Linear programming
        Type: general
      – SubjectFull: Approximation algorithms
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Maximizing the Total Weighted Operating Time for Surgery Scheduling via Linear Program Randomized Rounding Algorithms.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: CHEN, PO-AN
      – PersonEntity:
          Name:
            NameFull: CHENG, YA-WEN
      – PersonEntity:
          Name:
            NameFull: WU, TSUNG-JUI
      – PersonEntity:
          Name:
            NameFull: LIU, TZE-WEI
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2026
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-print
              Value: 10162364
          Numbering:
            – Type: volume
              Value: 42
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Journal of Information Science & Engineering
              Type: main
ResultId 1