{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T17:14:08Z","timestamp":1769188448099,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,18]],"date-time":"2013-12-18T00:00:00Z","timestamp":1387324800000},"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":[[2014,6]]},"DOI":"10.1007\/s10951-013-0362-9","type":"journal-article","created":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T10:28:42Z","timestamp":1387276122000},"page":"211-223","source":"Crossref","is-referenced-by-count":25,"title":["Complexity results for the basic residency scheduling problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Jiayi","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David R.","family":"Morrison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janet A.","family":"Jokela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,18]]},"reference":[{"key":"362_CR1","unstructured":"Accreditation Council for Graduate Medical Education (ACGME). (2009). ACGME program requirements for graduate medical education in internal medicine. ACGME. http:\/\/www.acgme.org\/acgmeweb\/Portals\/0\/PFAssets\/2013-PRFAQ-PIF\/140internalmedicine07012013.pdf . Accessed Dec 2013."},{"key":"362_CR2","unstructured":"Beli\u00ebn, J., & Demeulemeester, E. (2004). Heuristic branch-and-price for building long term trainee schedules. DTEW Research Report 0422, pp 1\u201322. https:\/\/lirias.kuleuven.be\/handle\/123456789\/85433 . Accessed Dec 2013."},{"key":"362_CR3","doi-asserted-by":"crossref","unstructured":"Beli\u00ebn, J., & Demeulemeester, E. (2006). Scheduling trainees at a hospital department using a branch-and-price approach. European Journal of Operational Research, 175(1), 258\u2013278.","DOI":"10.1016\/j.ejor.2005.04.028"},{"issue":"1","key":"362_CR4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(03)00096-1","volume":"153","author":"F Bellanti","year":"2004","unstructured":"Bellanti, F., Carello, G., & Tadei, R. (2004). A greedy-based neighborhood search approach to a nurse rostering problem. European Journal of Operational Research, 153(1), 28\u201340.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"362_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10729-011-9155-x","volume":"14","author":"JO Brunner","year":"2011","unstructured":"Brunner, J. O., & Edenharter, G. M. (2011). Long term staff scheduling of physicians with different experience levels in hospitals using column generation. Health Care Management Science, 14(2), 189\u2013202.","journal-title":"Health Care Management Science"},{"issue":"3","key":"362_CR6","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1287\/inte.1080.0369","volume":"39","author":"A Cohn","year":"2009","unstructured":"Cohn, A., Root, S., Kymissis, C., Esses, J., & Westmoreland, N. (2009). Scheduling medical residents at boston university school of medicine. Interfaces, 39(3), 186\u2013195.","journal-title":"Interfaces"},{"issue":"2","key":"362_CR7","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.cursur.2005.12.001","volume":"63","author":"T Day","year":"2006","unstructured":"Day, T., Napoli, J., & Kuo, P. (2006). Scheduling the resident 80-hour work week: An operations research algorithm. Current Surgery, 63(2), 136\u2013141.","journal-title":"Current Surgery"},{"issue":"2","key":"362_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1287\/opre.41.2.269","volume":"41","author":"L Franz","year":"1993","unstructured":"Franz, L., & Miller, J. (1993). Scheduling medical residents to rotations: Solving the large-scale multiperiod staff assignment problem. Operations Research, 41(2), 269\u2013279.","journal-title":"Operations Research"},{"key":"362_CR9","volume-title":"Computers and intractability a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability a guide to the theory of NP-completeness. New York: W. H. Freeman and Company."},{"issue":"2","key":"362_CR10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1111\/j.1540-5915.1988.tb00269.x","volume":"19","author":"K Gibert","year":"1988","unstructured":"Gibert, K., & Hofstra, R. (1988). Multidimensional assignment problems. Decision Sciences, 19(2), 306\u2013321.","journal-title":"Decision Sciences"},{"issue":"3","key":"362_CR11","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","volume":"34","author":"W Gutjahr","year":"2007","unstructured":"Gutjahr, W., & Rauner, M. (2007). An ACO algorithm for a dynamic regional nurse-scheduling problem in austria. Computers & Operations Research, 34(3), 642\u2013666.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"362_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10951-009-0108-x","volume":"13","author":"B Maenhout","year":"2009","unstructured":"Maenhout, B., & Vanhoucke, M. (2009). Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. Journal of Scheduling, 13(1), 77\u201393.","journal-title":"Journal of Scheduling"},{"issue":"8","key":"362_CR13","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/0305-0548(95)00073-9","volume":"23","author":"JL Miller","year":"1996","unstructured":"Miller, J. L., & Franz, L. S. (1996). A binary-rounding heuristic for multi-period variable-task-duration assignment problems. Computers and Operations Research, 23(8), 819\u2013828.","journal-title":"Computers and Operations Research"},{"key":"362_CR14","unstructured":"Osogami, T., & Imai, H. (2000). Classificaion of various neighborhood operations for the nurse scheduling problem. IBM TRL Research, Report, RT0373, Aug."},{"issue":"5","key":"362_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF00996605","volume":"18","author":"I Ozkarahan","year":"1994","unstructured":"Ozkarahan, I. (1994). A scheduling model for hospital residents. Journal of Medical Systems, 18(5), 251\u2013265.","journal-title":"Journal of Medical Systems"},{"key":"362_CR16","volume-title":"Combinatorial optimization: Algorithms and complexity","author":"S Papadimitriou","year":"1998","unstructured":"Papadimitriou, S., & Steiglitz, K. (1998). Combinatorial optimization: Algorithms and complexity. Mineola, NY: Dover."},{"issue":"3","key":"362_CR17","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.cie.2006.08.003","volume":"51","author":"S Topaloglu","year":"2006","unstructured":"Topaloglu, S. (2006). A multi-objective programming model for scheduling emergency medicine residents. Computers and Industrial Engineering, 51(3), 375\u2013388.","journal-title":"Computers and Industrial Engineering"},{"issue":"3","key":"362_CR18","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.ejor.2008.10.032","volume":"198","author":"S Topaloglu","year":"2009","unstructured":"Topaloglu, S. (2009). A shift scheduling model for employees with different seniority levels and an application in healthcare. European Journal of Operational Research, 198(3), 943\u2013957.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"362_CR19","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.cor.2010.04.018","volume":"38","author":"S Topaloglu","year":"2011","unstructured":"Topaloglu, S., & Ozkarahan, I. (2011). A constraint programming-based solution approach for medical resident scheduling problems. Computers and Operations Research, 38(1), 246\u2013255.","journal-title":"Computers and Operations Research"},{"key":"362_CR20","doi-asserted-by":"crossref","unstructured":"Turner, J., Kim, K., Mehrotra, S., DaRosa, D., Daskin, M., & Rodriguez, H. (2013). Using optimization models to demonstrate the need for structural changes in training programs for surgical medical residents. Health Care Management Science, 16(3), 217\u2013227.","DOI":"10.1007\/s10729-013-9230-6"},{"key":"362_CR21","doi-asserted-by":"crossref","unstructured":"Wang, C.-W., Sun, L.-M., Jin, M., Fu, C., Liu, L., Chan, C.-H., & Kao, C. (2007). A genetic algorithm for resident physician scheduling problem. In 8th Annual Conference on Genetic and Evolutionary Computation.","DOI":"10.1145\/1276958.1277380"},{"key":"362_CR22","volume-title":"Introduction to graph theory","author":"D West","year":"2001","unstructured":"West, D. (2001). Introduction to graph theory. Upper Saddle River, NJ: Prentice-Hall."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0362-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0362-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0362-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T00:51:07Z","timestamp":1564966267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0362-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,18]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0362-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,18]]}}}