Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling
详细信息    查看全文
文摘

We model multi-hospital priority-based surgical case scheduling as an integer program.

We develop novel logic-based Benders’ methods to solve our integer program.

We show incorporating both feasibility and optimality cuts expedites convergence.

We show the choice of implementation substantially accelerates convergence.

We show our new cut propagation mechanism leads to faster convergence.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700