{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:50:28Z","timestamp":1649101828572},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,13]],"date-time":"2007-07-13T00:00:00Z","timestamp":1184284800000},"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":[[2007,8,22]]},"DOI":"10.1007\/s10479-007-0217-x","type":"journal-article","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T22:17:09Z","timestamp":1184624229000},"page":"257-277","source":"Crossref","is-referenced-by-count":2,"title":["Towards a practical engineering tool for rostering"],"prefix":"10.1007","volume":"155","author":[{"given":"Edward","family":"Tsang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Ford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Mills","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Bradwell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,13]]},"reference":[{"key":"217_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0950-5849(03)00107-1","volume":"46","author":"A. Abbas","year":"2004","unstructured":"Abbas, A., & Tsang, E. P. K. (2004). Software engineering aspects of constraint-based timetabling\u2014a case study. Information & Software Technology Journal, 46, 359\u2013372.","journal-title":"Information & Software Technology Journal"},{"issue":"5","key":"217_CR2","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U. Aickelin","year":"2003","unstructured":"Aickelin, U., & Dowsland, K. A. (2003). An indirect algorithm for a nurse scheduling problem. Computers and Operational Research, 31(5), 761\u2013778.","journal-title":"Computers and Operational Research"},{"key":"217_CR3","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"Proc., 2nd international conference on principle and practice of constraint programming (CP\u201996)","author":"C. Bessi\u00e8re","year":"1996","unstructured":"Bessi\u00e8re, C., & R\u00e9gin, J. C. (1996). MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In LNCS : Vol. 1118. Proc., 2nd international conference on principle and practice of constraint programming (CP\u201996) (pp. 61\u201375). Cambridge: Springer."},{"issue":"4","key":"217_CR4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1011432307724","volume":"6","author":"J. E. Borrett","year":"2001","unstructured":"Borrett, J. E., & Tsang, E. P. K. (2001). A context for constraint satisfaction problem formulation selection. Constraints, 6(4), 299\u2013327.","journal-title":"Constraints"},{"key":"217_CR5","unstructured":"Borrett, J. E., Tsang, E. P. K., & Walsh, N. R. (1996). Adaptive constraint satisfaction: the quickest first principle. In Proceedings, 12th European conference on AI, Budapest, Hungary (pp. 160\u2013164)."},{"key":"217_CR6","doi-asserted-by":"crossref","unstructured":"Bourdais, S., Galinier, P., & Pesant, G. (2003). HIBISCUS: a constraint programming application to staff scheduling in health care. In Rossi, F. (Ed.), Proceedings, 9th principles and practice of constraint programming (CP 2003) (pp. 153\u2013167).","DOI":"10.1007\/978-3-540-45193-8_11"},{"key":"217_CR7","unstructured":"Bradwell, R., Ford, J., Mills, P., Tsang, E. P. K., & Williams, R. (2000). An overview of the CACP project: modelling and solving constraint satisfaction\/optimisation problems with minimal expert intervention. In Workshop on analysis and visualization of constraint programs and solvers, constraint programming, Singapore."},{"key":"217_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-48873-1_25","volume-title":"Simulated evolution and learning 1998","author":"E. K. Burke","year":"1999","unstructured":"Burke, E. K., De\u00a0Causmaecker, P., & Vanden Berghe, G. (1999). A hybrid tabu search algorithm for the nurse rostering problem. In B. McKay et al. (Eds.), LNCS : Vol. 1585. Simulated evolution and learning 1998 (pp. 187\u2013194). Berlin: Springer."},{"key":"217_CR9","first-page":"199","volume-title":"Applied Intelligence special issue on simulated evolution and learning","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., De\u00a0Causmaecker, P., Cowling, P., & Vanden Berghe, G. (2001). A memetic approach to the nurse rostering problem. In Applied Intelligence special issue on simulated evolution and learning (Vol.\u00a015, pp. 199\u2013214). Berlin: Springer."},{"key":"217_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4757-4137-7_7","volume-title":"Metaheuristics: computer decision-making","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., De\u00a0Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2003a). Variable neighbourhood search for nurse rostering problems. In M. C. G. Resende & J. Pinho de Sousa (Eds.), Metaheuristics: computer decision-making (Vol.\u00a07, pp. 153\u2013172). Dordrecht: Kluwer Academic."},{"key":"217_CR11","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of Meta-Heuristics","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Kendall, G., Newall, J., Hart, E., Ross, P., & Schulenburg, S. (2003b). Hyper-heuristics: an emerging direction in modern search technology. In F. Glover & G. Kochenberger (Eds.), Handbook of Meta-Heuristics (Vol.\u00a016, pp. 457\u2013474). Dordrecht: Kluwer Academic."},{"key":"217_CR12","series-title":"Springer lecture notes in computer science","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/978-3-540-45157-0_18","volume-title":"Practice and theory of automated timetabling IV","author":"E. Burke","year":"2003","unstructured":"Burke, E., MacCarthy, B., Petrovic, S., & Qu, R. (2003c). Knowledge discovery in a hyper-heuristic for course timetabling using case-based reasoning. In E. K. Burke & P. Decausmaecker (Eds.), Springer lecture notes in computer science : Vol. 2740. Practice and theory of automated timetabling IV (pp.\u00a0276\u2013287). Berlin: Springer."},{"issue":"6","key":"217_CR13","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., De\u00a0Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004). The state of the art of nurse rostering. The Journal of Scheduling, 7(6), 441\u2013499.","journal-title":"The Journal of Scheduling"},{"key":"217_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E. K. Burke","year":"2007","unstructured":"Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007). A graph-based hyper heuristic for timetabling problems. European Journal of Operational Research, 176, 177\u2013192.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"217_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"E. Burke","year":"2006","unstructured":"Burke, E., Petrovic, S., & Qu, R. (2006). Case based heuristic selection for timetabling problems. Journal of Scheduling, 9(2), 115\u2013132.","journal-title":"Journal of Scheduling"},{"key":"217_CR16","unstructured":"Chamard, A., Fischler, A., Guinaudeau, D.-B., & Guillard, A. (1995). CHIC lessons on CLP methodology. ECRC Report."},{"issue":"3","key":"217_CR17","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B. Cheang","year":"2003","unstructured":"Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003). Nurse rostering problems\u2014a bibliographic survey. European Journal of Operational Research, 151(3), 447\u2013460.","journal-title":"European Journal of Operational Research"},{"key":"217_CR18","unstructured":"Cheeseman, P., Kanefsky, B., & Taylor, W. M. (1991). Where the really hard problems are. In Proc., 12th international joint conference on AI (pp. 331\u2013337)."},{"key":"217_CR19","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R. (2003). Constraint processing. San Marko: Morgan Kaufmann."},{"key":"217_CR20","unstructured":"DiSCiPl debugging systems for constraint programming, http:\/\/discipl.inria.fr\/ , 1999."},{"issue":"1","key":"217_CR21","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A. Ernst","year":"2004","unstructured":"Ernst, A., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004a). Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research, 153(1), 3\u201327.","journal-title":"European Journal of Operational Research"},{"key":"217_CR22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"A. Ernst","year":"2004","unstructured":"Ernst, A., Jiang, H., Krishnamoorthy, M., Owens, B., & Sier, D. (2004b). Annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 127, 21\u2013144.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"217_CR23","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1023\/A:1009816801567","volume":"5","author":"A. Fernandez","year":"2000","unstructured":"Fernandez, A., & Hill, P. M. (2000). A comparative study of eight constraint programming languages over the Boolean and finite domains. Constraints, 5(3), 279\u2013305.","journal-title":"Constraints"},{"key":"217_CR24","unstructured":"Freuder, E. C. (1999). Modeling: the final frontier. In The first international conference on the practical application of constraint technologies and logic programming (PACLP), London, April 1999 (pp.\u00a015\u201321)."},{"key":"217_CR25","volume-title":"Constraint-based reasoning","year":"1994","unstructured":"Freuder, E. C., & Mackworth, A. (Eds.) (1994). Constraint-based reasoning. Cambridge: MIT Press."},{"key":"217_CR26","unstructured":"Gent, I. P., & Smith, B. (2000). Symmetry breaking in constraint programming. In Proceedings, European conference on artificial intelligence, Berlin, Germany, August 2000 (pp. 599\u2013603)."},{"key":"217_CR27","unstructured":"Gervet C. (2001). Large scale combinatorial optimization: a methodological viewpoint, DIMACS series in discrete mathematics and theoretical computer science (Vol.\u00a057, pp. 151\u2013175)."},{"key":"217_CR28","unstructured":"Hnich, B., Kiziltan, Z., & Walsh, T. (2002). Modelling a balanced academic curriculum problem. In Proceedings, fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems, CP-AI-OR\u201902 (pp. 121\u2013131)."},{"key":"217_CR29","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","volume":"69","author":"T. Hogg","year":"1994","unstructured":"Hogg, T., & Williams, C. P. (1994). The hardest constraint problems: a double phase transition. Research Note, Artificial Intelligence, 69, 359\u2013377.","journal-title":"Research Note, Artificial Intelligence"},{"issue":"1","key":"217_CR30","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J. N. Hooker","year":"1995","unstructured":"Hooker, J. N. (1995). Testing heuristics: we have it all wrong. Journal of Heuristics, 1(1), 33\u201342.","journal-title":"Journal of Heuristics"},{"key":"217_CR31","unstructured":"Kwan, A. (1997). A framework for mapping constraint satisfaction problems to solution methods. PhD Thesis, Department of Computer Science, University of Essex, Colchester, UK."},{"issue":"1","key":"217_CR32","first-page":"73","volume":"13","author":"J. Lever","year":"1995","unstructured":"Lever, J., Wallace, M., & Richards, B. (1995). Constraint logic programming for scheduling and planning. British Telecom Technology Journal, 13(1), 73\u201380.","journal-title":"British Telecom Technology Journal"},{"key":"217_CR33","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A., & Rodrigues, B. (2003). A hybrid AI approach for nurse rostering problem. In Proceedings of the 2003 ACM symposium on applied computing (pp. 730\u2013735). ACM Press.","DOI":"10.1145\/952532.952675"},{"key":"217_CR34","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-44629-X_12","volume-title":"Practice and theory of automated timetabling","author":"H. Meyer auf\u2019m Hofe","year":"2001","unstructured":"Meyer auf\u2019m Hofe, H. (2001a). Solving rostering tasks as constraint optimization. In E. Burke & W. Erben (Eds.), LNCS : Vol. 2079. Practice and theory of automated timetabling (pp. 191\u2013212). Berlin: Springer."},{"key":"217_CR35","series-title":"DIMACS series","first-page":"67","volume-title":"Constraint programming and large scale optimisation problems","author":"H. Meyer auf\u2019m Hofe","year":"2001","unstructured":"Meyer auf\u2019m Hofe, H. (2001b). Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies. In E. C. Freuder & R. J. Wallace (Eds.), DIMACS series : Vol. 57. Constraint programming and large scale optimisation problems (pp. 67\u201399). Providence: AMS."},{"key":"217_CR36","unstructured":"Michel, L., & Van Hentenryck, P. (2001). OPL++: a modeling layer for constraint programming libraries. In Proceedings, third international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CP-AI-OR-01), Wye, UK, 8\u201310 April 2001 (pp. 205\u2013219)."},{"key":"217_CR37","unstructured":"Mills, P. (2002). Extensions to guided local search. PhD Thesis, Department of Computer Science, University of Essex, Colchester, UK."},{"key":"217_CR38","unstructured":"Mills, P., Tsang, E. P. K., Williams, R., Ford, J., & Borrett, J. (1998). EaCL 1.0: an easy abstract constraint programming language. Technical Report CSM-321, University of Essex, Colchester, UK."},{"key":"217_CR39","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1021857607524","volume":"118","author":"P. Mills","year":"2003","unstructured":"Mills, P., Tsang, E. P. K., & J. Ford, J. (2003). Applying an extended guided local search to the quadratic assignment problem. Annals of Operations Research, 118, 121\u2013135.","journal-title":"Annals of Operations Research"},{"key":"217_CR40","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1007\/978-3-540-45193-8_81","volume-title":"Proc., principles and practice of constraint programming (CP 2003)","author":"K. E. Petrie","year":"2003","unstructured":"Petrie, K. E., & Smith, B. M. (2003). Symmetry breaking in graceful graphs. In F. Rossi (Ed.), LNCS : Vol. 2833. Proc., principles and practice of constraint programming (CP 2003) (pp. 930\u2013934). Berlin: Springer."},{"key":"217_CR41","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-49481-2_28","volume-title":"Proceedings, 4th international conference on principles and practice of constraint programming\u2014CP98","author":"R. Rodosek","year":"1998","unstructured":"Rodosek, R., & Wallace, M. (1998). A generic model and hybrid algorithm for hoist scheduling problems. In M. Maher & J.-F. Puget (Eds.), LNCS : Vol. 1520. Proceedings, 4th international conference on principles and practice of constraint programming\u2014CP98, Pisa, Italy, October 1998 (pp. 385\u2013399). Berlin: Springer."},{"key":"217_CR42","first-page":"526","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"P. Ross","year":"2005","unstructured":"Ross, P. (2005). Hyper-heuristics. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimization and decision support techniques (pp. 526\u2013529). Berlin: Springer. Chap.\u00a017."},{"key":"217_CR43","doi-asserted-by":"crossref","unstructured":"Sabin, D., & Freuder, E. C. (1994). Contradicting conventional wisdom in constraint satisfaction. In Proc., 11th European conference on artificial intelligence (pp. 125\u2013129).","DOI":"10.1007\/3-540-58601-6_86"},{"key":"217_CR44","unstructured":"Smith, B. M., & Grant, S. A. (1995). Where the exceptionally hard problems are. In Proceedings, workshop on studying and solving really hard problems, first international conference on principles and practice of constraint programming, September 1995 (pp. 172\u2013182)."},{"key":"217_CR45","unstructured":"The Computer-aided Constraint Programming (CACP) Project (including links to downloads) http:\/\/cswww.essex.ac.uk\/Research\/CSP\/cacp\/ , funded by EPSRC, March 1997\u2013August 2000, led by Edward Tsang, John Ford and Paul Scott."},{"key":"217_CR46","volume-title":"Foundations of constraint satisfaction","author":"E. P. K. Tsang","year":"1993","unstructured":"Tsang, E. P. K. (1993). Foundations of constraint satisfaction. London: Academic."},{"key":"217_CR47","unstructured":"Tsang, E. P. K., Mills, P., Williams, R., Ford, J., & Borrett, J. (1999). A computer aided constraint programming system. In The first international conference on the practical application of constraint technologies and logic programming (PACLP), London, April 1999 (pp. 81\u201393)."},{"key":"217_CR48","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/0-306-48056-5_7","volume-title":"Handbook of metaheuristics","author":"C. Voudouris","year":"2003","unstructured":"Voudouris, C., & Tsang, E. P. K. (2003). Guided local search. In F. Glover (Ed.), Handbook of metaheuristics (pp. 185\u2013218). Dordrecht: Kluwer Academic. Chap.\u00a07."},{"issue":"1","key":"217_CR49","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:CONS.0000006181.40558.37","volume":"9","author":"M. Wallace","year":"2004","unstructured":"Wallace, M., Schimpf, J., Shen, K., & Harvey, W. (2004). On benchmarking constraint logic programming platforms. response to Fernandez and Hill\u2019s \u201cA comparative study of eight constraint programming languages over the Boolean and finite domains\u201d. Constraints, 9(1), 5\u201334.","journal-title":"Constraints"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0217-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0217-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0217-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:42Z","timestamp":1559153262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0217-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,13]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,8,22]]}},"alternative-id":["217"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0217-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,13]]}}}