DocumentCode
727643
Title
Optimal surgical scheduling based on Branch-and-Price
Author
Yuanjun Cheng ; Li Luo ; Tianjin Wang
Author_Institution
Dept. of Ind. Eng., Sichuan Univ., Chengdu, China
fYear
2015
fDate
22-24 June 2015
Firstpage
1
Lastpage
4
Abstract
Surgical scheduling is an important decision-making problem in the operational management of hospital. We formulate this problem as an Integer Programming model for the purpose of maximizing the surgical throughput, and discuss the decomposition property of the model based on the inner features of the surgical scheduling. At last an exact optimal method, Branch-and-Price, is proposed to solve the model.
Keywords
decision making; hospitals; integer programming; scheduling; surgery; branch-and-price; decision-making problem; hospital operational management; integer programming model; optimal surgical scheduling; Hospitals; Indexes; Job shop scheduling; Linear programming; Planning; Surgery; Throughput; Branch-and-Price; Integer Programming; surgical scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Service Systems and Service Management (ICSSSM), 2015 12th International Conference on
Conference_Location
Guangzhou
Print_ISBN
978-1-4799-8327-8
Type
conf
DOI
10.1109/ICSSSM.2015.7170176
Filename
7170176
Link To Document