| Publikationstyp: | Beitrag in wissenschaftlicher Zeitschrift |
| Art der Begutachtung: | Peer review (Publikation) |
| Titel: | Surgical case scheduling as a generalized job shop scheduling problem |
| Autor/-in: | Pham, Dinh-Nguyen Klinkert, Andreas |
| DOI: | 10.1016/j.ejor.2006.03.059 |
| Erschienen in: | European Journal of Operational Research |
| Band(Heft): | 185 |
| Heft: | 3 |
| Seite(n): | 1011 |
| Seiten bis: | 1025 |
| Erscheinungsdatum: | 2008 |
| Verlag / Hrsg. Institution: | Elsevier |
| ISSN: | 0377-2217 |
| Sprache: | Englisch |
| Schlagwörter: | Scheduling; Surgical case; Job shop; Operating room |
| Fachgebiet (DDC): | 362: Gesundheits- und Sozialdienste 510: Mathematik |
| Zusammenfassung: | Surgical 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. |
| URI: | https://digitalcollection.zhaw.ch/handle/11475/3611 |
| Volltext Version: | Publizierte Version |
| Lizenz (gemäss Verlagsvertrag): | Lizenz gemäss Verlagsvertrag |
| Departement: | School of Engineering |
| Organisationseinheit: | Institut für Datenanalyse und Prozessdesign (IDP) |
| Enthalten in den Sammlungen: | Publikationen School of Engineering |
Dateien zu dieser Ressource:
Es gibt keine Dateien zu dieser Ressource.
Zur Langanzeige
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.
Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt, soweit nicht anderweitig angezeigt.