Solving surgical cases assignment problem by a branch-and-price approach
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal International Journal of Production Economics.
Volume (Year): 112 (2008)
Issue (Month): 1 (March)
Contact details of provider:
Web page: http://www.elsevier.com/locate/ijpe
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Hifi, M. & Zissimopoulos, V., 1996. "A recursive exact algorithm for weighted two-dimensional cutting," European Journal of Operational Research, Elsevier, vol. 91(3), pages 553-564, June.
- Vissers, Jan M. H., 1998. "Patient flow-based allocation of inpatient resources: A case study," European Journal of Operational Research, Elsevier, vol. 105(2), pages 356-370, March.
- Guinet, Alain & Chaabane, Sondes, 2003. "Operating theatre planning," International Journal of Production Economics, Elsevier, vol. 85(1), pages 69-81, July.
- William S. Lovejoy & Ying Li, 2002. "Hospital Operating Room Capacity Expansion," Management Science, INFORMS, vol. 48(11), pages 1369-1387, November.
- Chen, Zhi-Long & Powell, Warren B., 1999. "A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 220-232, July.
- Lamiri, Mehdi & Grimaud, Frédéric & Xie, Xiaolan, 2009. "Optimization methods for a stochastic surgery planning problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 400-410, August.
- Ben Bachouch, Rym & Guinet, Alain & Hajri-Gabouj, Sonia, 2012. "An integer linear model for hospital bed planning," International Journal of Production Economics, Elsevier, vol. 140(2), pages 833-843.
- Gartner, Daniel & Kolisch, Rainer, 2014. "Scheduling the hospital-wide flow of elective patients," European Journal of Operational Research, Elsevier, vol. 233(3), pages 689-699.
- Choi, Sangdo & Wilhelm, Wilbert E., 2014. "An approach to optimize block surgical schedules," European Journal of Operational Research, Elsevier, vol. 235(1), pages 138-148.
- Francesca Guerriero & Rosita Guido, 2011. "Operational research in the management of the operating theatre: a survey," Health Care Management Science, Springer, vol. 14(1), pages 89-114, March.
- Fei, Hongying & Meskens, Nadine & Combes, Catherine & Chu, Chengbin, 2009. "The endoscopy scheduling problem: A case study with two specialised operating rooms," International Journal of Production Economics, Elsevier, vol. 120(2), pages 452-462, August.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.