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

Full description

Saved in:

Bibliographic Details
Published in:	Computational optimization and applications Vol. 69; no. 2; pp. 535 - 561
Main Authors:	Noorizadegan, Mahdi, Seifi, Abbas
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2018 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!