{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:44:48Z","timestamp":1761947088277},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence in Medicine"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1016\/s0933-3657(00)00062-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:07:50Z","timestamp":1027606070000},"page":"155-175","source":"Crossref","is-referenced-by-count":70,"title":["Hybrid optimization techniques for the workshift and rest assignment of nursing personnel"],"prefix":"10.1016","volume":"20","author":[{"given":"C","family":"Valouxis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E","family":"Housos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0933-3657(00)00062-2_BIB1","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1287\/mnsc.20.12.1561","article-title":"Scheduling a full-time workforce to meet cyclic staffing requirements","volume":"20","author":"Baker","year":"1974","journal-title":"Manage. Sci."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230200103","article-title":"A network model for the rotating workforce scheduling problem","volume":"20","author":"Balakrishnan","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0933-3657(00)00062-2_BIB3","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","article-title":"An additive algorithm for solving linear programs with zero-one variables","volume":"13","author":"Balas","year":"1965","journal-title":"Operations Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB4","unstructured":"Berrada I, Ferland J, Michelon P. A multi-objective approach for nurse scheduling. Technical report, Department d\u2019Informatique et de Recherche Operationelle, Universite de Montreal, Montreal, Canada, 1994."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB5","first-page":"101","article-title":"Manpower scheduling with variable demands and alternate weekends off","volume":"16","author":"Burns","year":"1978","journal-title":"INFOR"},{"key":"10.1016\/S0933-3657(00)00062-2_BIB6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/opre.35.1.100","article-title":"A modular approach to optimal multiple-shift manpower scheduling","volume":"35","author":"Burns","year":"1987","journal-title":"Operations Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB7","unstructured":"Caprara A, Fischetti M, Toth P. A heuristic method for the set covering problem. In: Cunningham WH, McCormick ST, editors. Proceedings of the Fifth IPCO Conference, Vancouver, Canada, Lecture Notes in Computer Science, vol. 1084. Berlin: Springer, 1996. p. 72\u201384."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","article-title":"Nurse scheduling with tabu search and strategic oscillation","volume":"106","author":"Dowsland","year":"1998","journal-title":"Eur. J. Operational Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/321941.321942","article-title":"An efficient implementation of Edmonds algorithm for maximum matching on graphs","volume":"23","author":"Gabow","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0933-3657(00)00062-2_BIB10","unstructured":"Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2014 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2014 Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB13","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0305-0548(86)90050-X","article-title":"The general employee scheduling problem: an integration of MS and AI","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Operations Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB14","unstructured":"ILOG, ILOG Solver 4.4 Reference Manual, June 1999."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(97)00330-5","article-title":"A generalized linear programming model for nurse scheduling","volume":"107","author":"Jaumard","year":"1998","journal-title":"Eur. J. Operational Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB16","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/S0377-2217(97)00006-4","article-title":"Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming","volume":"104","author":"Millar","year":"1998","journal-title":"Eur. J. Operational Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB17","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1287\/opre.24.5.857","article-title":"Nurse scheduling using mathematical programming","volume":"24","author":"Miller","year":"1976","journal-title":"Operations Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(79)90015-7","article-title":"Linear 0-1 programming: comparison of implicit enumeration algorithms","volume":"6","author":"Narula","year":"1979","journal-title":"Comput. Operations Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB19","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1080\/07408178808966185","article-title":"Goal programming modeling subsystem of a flexible nurse scheduling system","volume":"20","author":"Ozkarahan","year":"1988","journal-title":"IEEE Trans."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB20","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(95)00012-7","article-title":"A simulated annealing heuristic for shift-scheduling using non-continuously available employees","volume":"23","author":"Thompson","year":"1996","journal-title":"Comput. Operations Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB21","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.24.5.842","article-title":"Scheduling nursing personnel according to nursing preference: a mathematical programming approach","volume":"24","author":"Warner","year":"1976","journal-title":"Operations Res."},{"key":"10.1016\/S0933-3657(00)00062-2_BIB22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02099703","article-title":"An algorithm for large scale 0-1 integer programming with application to airline crew scheduling","volume":"57","author":"Wedelin","year":"1995","journal-title":"Ann. Operation Res."}],"container-title":["Artificial Intelligence in Medicine"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0933365700000622?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0933365700000622?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T17:52:11Z","timestamp":1556473931000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0933365700000622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0933365700000622"],"URL":"https:\/\/doi.org\/10.1016\/s0933-3657(00)00062-2","relation":{},"ISSN":["0933-3657"],"issn-type":[{"value":"0933-3657","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}