Optimal surgical scheduling based on Branch-and-Price

摘要

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.