Solving surgical cases assignement problem by a branch-and-bound approach
(2005) IESM′05 — Location: Marrakech, Maroc
Files
No attached file found for this publication.
Details
- Authors
Meskens, Nadine 
- Abstract
- In this paper, we consider a surgical cases assignment problem (SCAP) of assigning N surgical cases into M multifunctional operating rooms with an objective of minimizing total operating cost. Firstly, we formulate this problem as an integer problem and then reformulate the integer program by using Dantzig-Wolfe decomposition as a set partitioning problem. Based on this set partitioning formulation, a so-called branch-and-price exact solution algorithm, combining branch and bound with column generation method, is designed for the proposed problem where each node is the linear relaxation problem of a set partitioning problem. This linear relaxation problem is solved by a column generation approach where each column represents a plan for one operating room and is generated by solving a sub-problem of single operating room planning. The computational results indicate that the decomposition approach is promising and capable of solving large problems.
- Affiliations
Louvain School of Management
Citations
Fei, H., Meskens, N., Artiba, A., & Chu, C. (2005). Solving surgical cases assignement problem by a branch-and-bound approach. IESM′05, Marrakech, Maroc. https://hdl.handle.net/2078.5/128679