{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T18:00:53Z","timestamp":1783792853660,"version":"3.55.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,8,5]],"date-time":"2008-08-05T00:00:00Z","timestamp":1217894400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10479-008-0413-3","type":"journal-article","created":{"date-parts":[[2008,8,4]],"date-time":"2008-08-04T15:26:25Z","timestamp":1217863585000},"page":"91-108","source":"Crossref","is-referenced-by-count":119,"title":["Solving a tactical operating room planning problem by\u00a0a\u00a0column-generation-based heuristic procedure with\u00a0four criteria"],"prefix":"10.1007","volume":"166","author":[{"given":"H.","family":"Fei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"N.","family":"Meskens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,8,5]]},"reference":[{"key":"413_CR1","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"key":"413_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1213\/00000539-200201000-00027","volume":"94","author":"J. T. Blake","year":"2002","unstructured":"Blake, J. T., Dexter, F., & Donald, J. (2002). Operating room manager\u2019s use of integer programming for assigning block time to surgical groups: A case study. Anesthesia and Analgesia, 94, 143\u2013148.","journal-title":"Anesthesia and Analgesia"},{"issue":"1","key":"413_CR3","first-page":"78","volume":"11","author":"Z. Chen","year":"1999","unstructured":"Chen, Z., & Powell, W. B. (1999). Solving parallel machine scheduling problems by column generation. Journal of Computing, 11(1), 78\u201394.","journal-title":"Journal of Computing"},{"key":"413_CR4","unstructured":"Combes, C., Dussauchoy, A., Chaabane, S., Smolski, N., Viale, J. P., & Souquet, J. C. (2004). D\u00e9marche m\u00e9thodologique d\u2019analyse des donn\u00e9es pour la planification des blocs op\u00e9ratoires: une application \u00e0 un service d\u2019endoscopie, Actes GISEH\u201904, Mons, Belgium."},{"key":"413_CR5","unstructured":"Corens, D., (2007). Belgium: Health system review. S. Merkur, N. Jemiai & W. Palm (Eds.), Health systems in transition, 9(2). World Health Organization."},{"key":"413_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G. B. Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8, 101\u2013111.","journal-title":"Operations Research"},{"key":"413_CR7","first-page":"925","volume":"91","author":"F. Dexter","year":"2000","unstructured":"Dexter, F. (2000). A strategy to decide whether to move the last case of the day in an operating room to other empty operating room to decrease overtime labor costs. International Anesthesia Research Society, 91, 925\u2013928.","journal-title":"International Anesthesia Research Society"},{"key":"413_CR8","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1097\/00000542-199911000-00043","volume":"91","author":"F. Dexter","year":"1999","unstructured":"Dexter, F., Macario, A., & Traub, R. D. (1999). Which algorithm for scheduling add-on Elective cases maximizes operating room utilization? Anesthesiology, 91, 1491\u20131500.","journal-title":"Anesthesiology"},{"key":"413_CR9","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1213\/00000539-200302000-00038","volume":"96","author":"F. Dexter","year":"2003","unstructured":"Dexter, F., Traub, R. D., & Macario, A. (2003). How to release allocated operating room time to increase efficiency: predicting which surgical service will have the most underutilized operating room time. Anesthesia and Analgesia, 96, 507\u2013512.","journal-title":"Anesthesia and Analgesia"},{"key":"413_CR10","unstructured":"Fei, H., Combes, C., Meskens, N., & Chu, C. (2006). Endoscopy scheduling problem: a case study, INCOM2006 (pp. 635\u2013640), st-Etienne, France."},{"key":"413_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00996639","volume":"12","author":"T. Gordon","year":"1988","unstructured":"Gordon, T., Lyles, A. P. S., & Fountain, J. (1988). Surgical unit time utilization review: Resource utilization and management implications. Journal of Medical Systems, 12, 169\u2013179.","journal-title":"Journal of Medical Systems"},{"issue":"1","key":"413_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0925-5273(03)00087-2","volume":"85","author":"A. Guinet","year":"2003","unstructured":"Guinet, A., & Chaabane, S. (2003). Operating theatre planning. International Journal of Production Economics, 85(1), 69\u201381.","journal-title":"International Journal of Production Economics"},{"key":"413_CR13","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ijpe.2004.12.006","volume":"99","author":"A. Jebali","year":"2006","unstructured":"Jebali, A., Hadj Alouane, A. B., & Ladet, P. (2006). Operating room scheduling. International Journal of Productions Economics, 99, 52\u201362.","journal-title":"International Journal of Productions Economics"},{"issue":"6","key":"413_CR14","first-page":"2","volume":"83","author":"A. Macario","year":"1995","unstructured":"Macario, A., Vitez, T. S., Dunn, B., & Mcdonaled, T. (1995). Where are the costs in perioperative care? Anesthesiology, 83(6), 2\u20134.","journal-title":"Anesthesiology"},{"key":"413_CR15","volume-title":"Knapsack problems: algorithms and computer implementation","author":"S. Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: algorithms and computer implementation. New York: Wiley."},{"key":"413_CR16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02257264","volume":"19","author":"I. Ozkarahan","year":"1995","unstructured":"Ozkarahan, I. (1995). Allocation of surgical procedures to operating rooms. Journal of Medical Systems, 19, 333\u2013352.","journal-title":"Journal of Medical Systems"},{"issue":"6","key":"413_CR17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1023\/A:1005548727003","volume":"24","author":"I. Ozkarahan","year":"2000","unstructured":"Ozkarahan, I. (2000). Allocation of surgeries to operating rooms using goal programming. Journal of Medical Systems, 24(6), 339\u2013378.","journal-title":"Journal of Medical Systems"},{"issue":"9","key":"413_CR18","first-page":"19","volume":"12","author":"P. Patterson","year":"1996","unstructured":"Patterson, P. (1996). What makes a well-oiled scheduling system. OR Manager, 12(9), 19\u201323.","journal-title":"OR Manager"},{"issue":"1","key":"413_CR19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1111\/j.1475-3995.1998.tb00100.x","volume":"5","author":"J. M. V. Valv\u00e9rio de Carvalho","year":"1998","unstructured":"Valv\u00e9rio de Carvalho, J. M. V. (1998). Exact solution of cutting stock problems using column generation and branch-and-bound. International Transactions in Operational Research, 5(1), 35\u201344.","journal-title":"International Transactions in Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0413-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0413-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0413-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T07:47:29Z","timestamp":1631605649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0413-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,5]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["413"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0413-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,5]]}}}