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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational optimization and applications Ročník 69; číslo 2; s. 535 - 561
Hlavní autori:	Noorizadegan, Mahdi, Seifi, Abbas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2018 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!