An efficient computational method for large scale surgery scheduling problems with chance constraints

We propose an efficient solution method based on a decomposition of set-partitioning formulation of an integrated surgery planning and scheduling problem with chance constraints. The studied problem is characterized by a set of identical operating rooms (ORs), a set of surgeries with uncertain durat...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational optimization and applications Jg. 69; H. 2; S. 535 - 561
Hauptverfasser:	Noorizadegan, Mahdi, Seifi, Abbas
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.03.2018 Springer Nature B.V
Schlagworte:	Columnar structure Computer simulation Convex and Discrete Geometry Decomposition Formulations Job shops Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Production scheduling Scheduling Search algorithms Sensitivity analysis Shortest-path problems Statistics Surgeons Surgery Integer programming Integer chance constrained programming Set-partitioning formulation Surgery planning and scheduling
ISSN:	0926-6003, 1573-2894
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!