{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T02:28:58Z","timestamp":1773109738791,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T00:00:00Z","timestamp":1342656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10951-012-0278-9","type":"journal-article","created":{"date-parts":[[2012,7,19]],"date-time":"2012-07-19T09:18:32Z","timestamp":1342689512000},"page":"513-535","source":"Crossref","is-referenced-by-count":27,"title":["Multi-objective scheduling and a resource allocation problem in hospitals"],"prefix":"10.1007","volume":"15","author":[{"given":"Silvija","family":"Vlah Jeri\u0107","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Rui","family":"Figueira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,19]]},"reference":[{"key":"278_CR1","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.ejor.2005.06.063","volume":"176","author":"J. Beli\u00ebn","year":"2007","unstructured":"Beli\u00ebn, J., & Demeulemeester, E. (2007). Building cyclic master surgery schedules with leveled resulting bed occupancy. European Journal of Operational Research, 176, 1185\u20131204.","journal-title":"European Journal of Operational Research"},{"key":"278_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/inte.32.2.63.57","volume":"32","author":"J. T. Blake","year":"2002","unstructured":"Blake, J. T., & Donald, J. (2002). Mount Sinai hospital uses integer programming to allocate operating room time. Interfaces, 32, 63\u201373.","journal-title":"Interfaces"},{"key":"278_CR3","first-page":"1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Causmaecker, P., & Vanden Berghe, G. (2004a). Novel metaheuristic approaches to nurse rostering problems in Belgian hospitals. In J. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (Vol.\u00a018, pp.\u00a01\u201344). Boca Raton: CRC Press."},{"key":"278_CR4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004b). The state of the art of nurse rostering. Journal of Scheduling, 7, 441\u2013499.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"278_CR5","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"188","author":"E. K. Burke","year":"2008","unstructured":"Burke, E. K., Curtois, T., Post, G., Qu, R., & Veltman, B. (2008). A\u00a0hybrid heuristic ordering and variable neighborhood search for the nurse rostering problem. European Journal of Operational Research, 188(2), 330\u2013334.","journal-title":"European Journal of Operational Research"},{"key":"278_CR6","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.ijpe.2009.03.009","volume":"119","author":"B. Cardoen","year":"2009","unstructured":"Cardoen, B., Demeulemeester, E., & Beli\u00ebn, J. (2009a). Optimizing a multiple objective surgical case sequencing problem. International Journal of Production Economics, 119, 354\u2013366.","journal-title":"International Journal of Production Economics"},{"key":"278_CR7","doi-asserted-by":"crossref","first-page":"2660","DOI":"10.1016\/j.cor.2008.11.012","volume":"36","author":"B. Cardoen","year":"2009","unstructured":"Cardoen, B., Demeulemeester, E., & Beli\u00ebn, J. (2009b). Sequencing surgical cases in a daycare environment: an exact branch-and-price approach. Computers & Operations Research, 36, 2660\u20132669.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"278_CR8","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/j.ejor.2007.02.029","volume":"186","author":"C. C. Chern","year":"2008","unstructured":"Chern, C. C., Chien, P. S., & Chen, S. Y. (2008). A\u00a0heuristic algorithm for the hospital health examination scheduling problem. European Journal of Operational Research, 186(3), 1137\u20131157.","journal-title":"European Journal of Operational Research"},{"key":"278_CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-48584-1_8","volume-title":"Evolutionary scheduling","author":"D. Datta","year":"2007","unstructured":"Datta, D., Deb, K., & Fonseca, C. M. (2007). Multi-objective evolutionary algorithm for university class timetabling problem. In Evolutionary scheduling (pp.\u00a0197\u2013236)."},{"key":"278_CR10","series-title":"Wiley-Interscience series in systems and optimization","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K. Deb","year":"2001","unstructured":"Deb, K. (2001). Wiley-Interscience series in systems and optimization: Multi-objective optimization using evolutionary algorithms. Chichester: Wiley."},{"key":"278_CR11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K. Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A\u00a0fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6, 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"278_CR12","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M., & Gandibleux, X. (2000). A\u00a0survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum, 22, 425\u2013460.","journal-title":"OR-Spektrum"},{"key":"278_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1990","unstructured":"Garey, M. R., & Johnson, D. S. (1990). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"key":"278_CR14","first-page":"3","volume-title":"AE \u201997: selected papers from the third European conference on artificial evolution","author":"F. Glover","year":"1998","unstructured":"Glover, F. (1998). A template for scatter search and path relinking. In AE \u201997: selected papers from the third European conference on artificial evolution (pp.\u00a03\u201354). London: Springer."},{"issue":"3","key":"278_CR15","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., & Mart\u00ed, R. (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 39(3), 653\u2013684.","journal-title":"Control and Cybernetics"},{"issue":"3","key":"278_CR16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovi\u0107, N. (2001). Variable neighborhood search: principles and applications. European Journal of Operational Research, 130(3), 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"278_CR17","unstructured":"Knowles, J., Thiele, L., & Zitzler, E. (2006). A tutorial on the performance assessment of stochastic multiobjective optimizers. TIK report 214, Computer Engineering and Networks Laboratory (TIK), ETH, Zurich."},{"issue":"1","key":"278_CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0925-5273(03)00088-4","volume":"85","author":"E. Marcon","year":"2003","unstructured":"Marcon, E., Kharraja, S., & Simonnet, G. (2003). The operating theatre planning by the follow-up of the risk of no realization. International Journal of Production Economics, 85(1), 83\u201390.","journal-title":"International Journal of Production Economics"},{"issue":"11","key":"278_CR19","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"278_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/ijoc.1050.0149","volume":"19","author":"J. Molina","year":"2007","unstructured":"Molina, J., Laguna, L., Mart\u00ed, R., & Caballero, R. (2007). SSPMO: a\u00a0scatter tabu search procedure for non-linear multiobjective optimization. INFORMS Journal on Computing, 19(1), 91\u2013100.","journal-title":"INFORMS Journal on Computing"},{"issue":"1\u20134","key":"278_CR21","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02023077","volume":"41","author":"E. L. Mooney","year":"1993","unstructured":"Mooney, E. L., & Rardin, R. L. (1993). Tabu search for a class of scheduling problems. Annals of Operations Research, 41(1\u20134), 253\u2013278.","journal-title":"Annals of Operations Research"},{"key":"278_CR22","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/978-3-540-31880-4_31","volume-title":"Third international conference on evolutionary MultiCriterion optimization, EMO 2005","author":"A. J. Nebro","year":"2005","unstructured":"Nebro, A. J., Luna, F., & Alba, E. (2005). New ideas in applying scatter search to multiobjective optimization. In Lecture notes in computer science: Vol.\u00a03410. Third international conference on evolutionary MultiCriterion optimization, EMO 2005 (pp.\u00a0443\u2013458). Berlin: Springer."},{"issue":"9","key":"278_CR23","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"},{"key":"278_CR24","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.ejor.2004.08.005","volume":"169","author":"C. Silva Gomes da","year":"2006","unstructured":"Gomes da Silva, C., Cl\u00edmaco, C., & Figueira, J. (2006). A\u00a0scatter search method for bi-criteria {0,1}-knapsack problems. European Journal of Operational Research, 169, 373\u2013391.","journal-title":"European Journal of Operational Research"},{"key":"278_CR25","unstructured":"Tan, Y. Y. (2008). Multi-objective optimization for scheduling elective surgical patients at the health sciences centre in Winnipeg. Master\u2019s thesis. available at. http:\/\/hdl.handle.net\/1993\/3081 ."},{"key":"278_CR26","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1057\/jors.2010.73","volume":"62","author":"S. Vlah","year":"2011","unstructured":"Vlah, S., Luka\u010d, Z., & Pacheco, J. (2011). Use of VNS heuristic for scheduling of patients in hospital. Journal of the Operational Research Society, 62, 1227\u20131238.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"278_CR27","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., & Thiele, L. (1999). Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto evolutionary algorithm. IEEE Transactions on Evolutionary Computation, 3(4), 257\u2013271.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"278_CR28","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E. Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & da Fonseca, V. G. (2003). Performance assessment of multiobjective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation, 7(2), 117\u2013132.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0278-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0278-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0278-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:47Z","timestamp":1559468387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0278-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,19]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["278"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0278-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,19]]}}}