{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T04:14:32Z","timestamp":1742098472904,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642272448"},{"type":"electronic","value":"9783642272455"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-27245-5_25","type":"book-chapter","created":{"date-parts":[[2011,12,9]],"date-time":"2011-12-09T14:37:08Z","timestamp":1323441428000},"page":"202-211","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Local Search Approaches in Solving the Nurse Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Sudip","family":"Kundu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriyankar","family":"Acharyya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Abdennadher, S., Schlenker, H.: Nurse scheduling using constraint logic programming. In: Proc. of the 11th Annual Conference on Innovative Applications of Artificial Intelligence (IAAI-1999), Orlando, Florida, United States, July 18-22, pp. 838\u2013843 (1999)"},{"key":"25_CR2","unstructured":"Acharyya, S.: The Satisfiability Problem: A Constraint Satisfaction Approach, PhD Thesis, Computer Science & Engg., Calcutta University (2001)"},{"key":"25_CR3","unstructured":"Acharyya, S., Bagchi, A.: A SAT Approach for Solving The Staff Transfer Problem. In: Ao, S.I., Castillo, O., Douglas, C., Feng, D.D., Lee, J.-A. (eds.) IMECS-2008, Proceedings of International MultiConference of Engineers and Computer Scientists, Hong Kong. Lecture Notes in Engineering and Computer Science, pp. 64\u201368 (2008)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","volume":"3","author":"U. Aickelin","year":"2000","unstructured":"Aickelin, U., Dowsland: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling\u00a03, 139\u2013153 (2000)","journal-title":"Journal of Scheduling"},{"issue":"5","key":"25_CR5","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U. Aickelin","year":"2004","unstructured":"Aickelin, U., Kathryn, A., Dowsland: An indirect genetic algorithm for a nurse-scheduling problem. Computers and Operations Research\u00a031(5), 761\u2013778 (2004)","journal-title":"Computers and Operations Research"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/05695558108974536","volume":"13","author":"J.L. Arthur","year":"1981","unstructured":"Arthur, J.L., Ravindran, A.: A Multiple Objective Nurse Scheduling Model. AIIE Transactions\u00a013, 55\u201360 (1981)","journal-title":"AIIE Transactions"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0305-0548(03)00249-1","volume":"32","author":"M.N. Azaiez","year":"2005","unstructured":"Azaiez, M.N., Al Sharif, S.S.: A 0-1 goal programming model for nurse scheduling. Computers and Operations Research\u00a032(3), 491\u2013507 (2005)","journal-title":"Computers and Operations Research"},{"issue":"2-3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"Dowsland","year":"1998","unstructured":"Dowsland: Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research\u00a0106(2-3), 393\u2013407 (1998)","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"25_CR9","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1057\/palgrave.jors.2600970","volume":"51","author":"Dowsland","year":"2000","unstructured":"Dowsland, Thompson: Solving a nurse scheduling problem with knapsacks, networks and tabu search. Journal of the Operational Research Society\u00a051(7), 825\u2013833 (2000)","journal-title":"Journal of the Operational Research Society"},{"key":"25_CR10","unstructured":"Fukunaga, A.S.: Variable Selection Heuristics in Local Search for SAT. In: Proc. AAAI-1997, pp. 275\u2013280 (1997)"},{"key":"25_CR11","unstructured":"Hoos, H.H.: On the Run-time Behavior of Stochastic Local Search Algorithms for SAT. In: Proc. AAAI-1999, pp. 661\u2013666 (1999)"},{"key":"25_CR12","first-page":"436","volume":"41","author":"A. Ikegami","year":"1996","unstructured":"Ikegami, A., Niwa, A., Ohkura, M.: Nurse scheduling in Japan. Commun. Oper. Res. Society of Japan\u00a041, 436\u2013442 (1996) (in Japanese)","journal-title":"Oper. Res. Society of Japan"},{"issue":"1","key":"25_CR13","first-page":"32","volume":"13","author":"V. Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for Constraint Satisfaction Problems: A Survey. A I Magazine\u00a013(1), 32\u201344 (1992)","journal-title":"A I Magazine"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Kundu, S., Mahato, M., Mahanty, B., Acharyya, S.: Comparative Performance of Simulated Annealing and Genetic Algorithm in Solving Nurse Scheduling Problem. In: Ao, S.I., Castillo, O., Douglas, C., Feng, D.D., Lee, J.-A. (eds.) IMECS-2008, Proceedings of International MultiConference of Engineers and Computer Scientists, Hong Kong. Lecture Notes in Engineering and Computer Science, pp. 96\u2013100 (2008)","DOI":"10.1109\/TENCON.2008.4766380"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Kundu, S., Acharyya, S.: A SAT Approach for Solving The Nurse Scheduling Problem. In: Proc. IEEE TENCON-2008, CD, Session P16 (Algorithms and Architecture), Hyderabad, India, November 18-21, 6 Pages (2008)","DOI":"10.1109\/TENCON.2008.4766380"},{"issue":"1","key":"25_CR16","first-page":"46","volume":"4","author":"S. Kundu","year":"2010","unstructured":"Kundu, S., Acharyya, S.: Performance of WalkSAT in Solving The Nurse Scheduling Problem. International Journal of Information Processing\u00a04(1), 46\u201353 (2010)","journal-title":"International Journal of Information Processing"},{"key":"25_CR17","unstructured":"MacAllester, D., Selman, B., Kautz, H.: Evidence for Invariants in Local Search. In: Proc. AAAI-1997, pp. 321\u2013326 (1997)"},{"key":"25_CR18","unstructured":"Mazure, B., Sais, L., Gregoire, E.: Tabu Search for SAT. In: Proc. AAAI-1997, pp. 281\u2013285 (1997)"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press (1996)","DOI":"10.7551\/mitpress\/3927.001.0001"},{"issue":"3","key":"25_CR20","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/S0377-2217(97)00006-4","volume":"104","author":"Kiragu Millar","year":"1998","unstructured":"Millar, Kiragu: European Journal of Operational Research\u00a0104(3), 582\u2013592 (February 1, 1998)","journal-title":"European Journal of Operational Research"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1080\/07408178408974687","volume":"16","author":"A. Musa","year":"1984","unstructured":"Musa, A., Saxena, U.: Scheduling Nurses Using Goal-Programming Techniques. IIE Transactions\u00a016, 216\u2013221 (1984)","journal-title":"IIE Transactions"},{"key":"25_CR22","unstructured":"Post, G., Veltman, B.: Harmonious Personnel Scheduling. In: Proceedings of the 5th International Conference on the Practice and Automated Timetabling, PATAT 2004, pp. 557\u2013559 (2004)"},{"key":"25_CR23","unstructured":"Reeves, C.R.: Modern Heuristic Techniques for Combinatorial Problems. Orient Longman (1993)"},{"key":"25_CR24","unstructured":"Selman, B., Levesque, H.J., Mitchell, D.J.: A New Method for Solving Hard Satisfiability Problems. In: Proc. AAAI-1992, pp. 440\u2013446 (1992)"},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.24.5.842","volume":"24","author":"H.W. Warner","year":"1976","unstructured":"Warner, H.W.: Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Approach. Operations Research\u00a024, 842\u2013856 (1976)","journal-title":"Operations Research"}],"container-title":["Communications in Computer and Information Science","Computer Information Systems \u2013 Analysis and Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27245-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T10:52:41Z","timestamp":1742035961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27245-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642272448","9783642272455"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27245-5_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}