1. ZHAW digitalcollection
  2. School of Engineering
  3. Publikationen
  4. Publikationen School of Engineering
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPham, Dinh-Nguyen-
dc.contributor.authorKlinkert, Andreas-
dc.date.accessioned2018-03-08T15:39:16Z-
dc.date.available2018-03-08T15:39:16Z-
dc.date.issued2008-
dc.identifier.issn0377-2217de_CH
dc.identifier.urihttps://digitalcollection.zhaw.ch/handle/11475/3611-
dc.description.abstractSurgical case scheduling allocates hospital resources to individual surgical cases and decides on the time to perform the surgeries. This task plays a decisive role in utilizing hospital resources efficiently while ensuring quality of care for patients. This paper proposes a new surgical case scheduling approach which uses a novel extension of the Job Shop scheduling problem called multi-mode blocking job shop (MMBJS). It formulates the MMBJS as a mixed integer linear programming (MILP) problem and discusses the use of the MMBJS model for scheduling elective and add-on cases. The model is illustrated by a detailed example, and preliminary computational experiments with the CPLEX solver on practical-sized instances are reported.de_CH
dc.language.isoende_CH
dc.publisherElsevierde_CH
dc.relation.ispartofEuropean Journal of Operational Researchde_CH
dc.rightsLicence according to publishing contractde_CH
dc.subjectSchedulingde_CH
dc.subjectSurgical casede_CH
dc.subjectJob shopde_CH
dc.subjectOperating roomde_CH
dc.subject.ddc362: Gesundheits- und Sozialdienstede_CH
dc.subject.ddc510: Mathematikde_CH
dc.titleSurgical case scheduling as a generalized job shop scheduling problemde_CH
dc.typeBeitrag in wissenschaftlicher Zeitschriftde_CH
dcterms.typeTextde_CH
zhaw.departementSchool of Engineeringde_CH
zhaw.organisationalunitInstitut für Datenanalyse und Prozessdesign (IDP)de_CH
dc.identifier.doi10.1016/j.ejor.2006.03.059de_CH
zhaw.funding.euNode_CH
zhaw.issue3de_CH
zhaw.originated.zhawYesde_CH
zhaw.pages.end1025de_CH
zhaw.pages.start1011de_CH
zhaw.publication.statuspublishedVersionde_CH
zhaw.volume185de_CH
zhaw.publication.reviewPeer review (Publikation)de_CH
Appears in collections:Publikationen School of Engineering

Files in This Item:
There are no files associated with this item.
Show simple item record
Pham, D.-N., & Klinkert, A. (2008). Surgical case scheduling as a generalized job shop scheduling problem. European Journal of Operational Research, 185(3), 1011–1025. https://doi.org/10.1016/j.ejor.2006.03.059
Pham, D.-N. and Klinkert, A. (2008) ‘Surgical case scheduling as a generalized job shop scheduling problem’, European Journal of Operational Research, 185(3), pp. 1011–1025. Available at: https://doi.org/10.1016/j.ejor.2006.03.059.
D.-N. Pham and A. Klinkert, “Surgical case scheduling as a generalized job shop scheduling problem,” European Journal of Operational Research, vol. 185, no. 3, pp. 1011–1025, 2008, doi: 10.1016/j.ejor.2006.03.059.
PHAM, Dinh-Nguyen und Andreas KLINKERT, 2008. Surgical case scheduling as a generalized job shop scheduling problem. European Journal of Operational Research. 2008. Bd. 185, Nr. 3, S. 1011–1025. DOI 10.1016/j.ejor.2006.03.059
Pham, Dinh-Nguyen, and Andreas Klinkert. 2008. “Surgical Case Scheduling as a Generalized Job Shop Scheduling Problem.” European Journal of Operational Research 185 (3): 1011–25. https://doi.org/10.1016/j.ejor.2006.03.059.
Pham, Dinh-Nguyen, and Andreas Klinkert. “Surgical Case Scheduling as a Generalized Job Shop Scheduling Problem.” European Journal of Operational Research, vol. 185, no. 3, 2008, pp. 1011–25, https://doi.org/10.1016/j.ejor.2006.03.059.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.