Copyright © 2007 Elsevier B.V. All rights reserved.
Received 6 December 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this paper, we study a surgical cases assignment problem (SCAP) of assigning a set of surgical cases to several 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–Wolf 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 procedure with column generation (CG) 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 CG approach in which each column represents a plan for one operating room and is generated by solving a sub-problem (SP) of single operating room planning problem. The computational results indicate that the decomposition approach is promising and capable of solving large problems.
Keywords: Surgical cases assignment problem; Dantzig–Wolfe decomposition; Column generation; Branch-and-price
Article Outline
- 1. Introduction
- 2. General integer programming
- 3. Framework of branch-and-price procedure
- 4. Set partitioning general problem (GP) corresponding to general integer problem (GIP)
- 5. Framework of heuristic procedure based on column generation
- 6. Selection strategy of node and branching variable
- 7. Experimental results
- 7.1. Data
- 7.2. Computational results
- 8. Conclusion and perspective
- References







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)







