{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T05:14:20Z","timestamp":1776402860068,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,1,27]],"date-time":"2011-01-27T00:00:00Z","timestamp":1296086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10732-011-9158-2","type":"journal-article","created":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T16:56:56Z","timestamp":1296061016000},"page":"119-148","source":"Crossref","is-referenced-by-count":24,"title":["The balanced academic curriculum problem revisited"],"prefix":"10.1007","volume":"18","author":[{"given":"Marco","family":"Chiarandini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Gualandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,27]]},"reference":[{"key":"9158_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R. Ahuja","year":"2002","unstructured":"Ahuja, R., Ergun, \u00d6., Orlin, J., Punnen, A.: A survey of very-large-scale neighborhood search techniques. Discrete Appl. Math. 123, 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9158_CR2","first-page":"11","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002)","author":"M. Birattari","year":"2002","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Langdon, W.B., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), pp.\u00a011\u201318. Morgan Kaufmann, San Mateo (2002)"},{"key":"9158_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/978-3-540-73354-6_31","volume-title":"HCI","author":"C. Castro","year":"2007","unstructured":"Castro, C., Crawford, B., Monfroy, E.: A quantitative approach for the design of academic curricula. In: HCI. Lecture Notes in Computer Science, vol.\u00a04558, pp.\u00a0279\u2013288. Springer, Berlin (2007)"},{"key":"9158_CR4","volume-title":"6th Workshop of the ERCIM WG on Constraints","author":"C. Castro","year":"2001","unstructured":"Castro, C., Manzano, S.: Variable and value ordering when solving balanced academic curriculum problems. In: 6th Workshop of the ERCIM WG on Constraints (2001)"},{"issue":"8","key":"9158_CR5","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L. Gaspero Di","year":"2003","unstructured":"Di Gaspero, L., Schaerf, A.: EasyLocal++: An object-oriented framework for flexible design of local search algorithms. Softw. Pract. Exp. 33(8), 733\u2013765 (2003)","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"9158_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. Gaspero Di","year":"2006","unstructured":"Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. J. Math. Model. Algorithms 5(1), 65\u201389 (2006)","journal-title":"J. Math. Model. Algorithms"},{"key":"9158_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-540-88439-2_11","volume-title":"Hybrid Metaheuristics","author":"L. Gaspero Di","year":"2008","unstructured":"Di Gaspero, L., Schaerf, A.: Hybrid local search techniques for the generalized balanced academic curriculum problem. In: Blesa, M.J., Blum, C., Cotta, C., Fern\u00e1ndez, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Lecture Notes in Computer Science, vol.\u00a05296, pp.\u00a0146\u2013157. Springer, Berlin (2008)"},{"key":"9158_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/BFb0056916","volume-title":"Parallel Problem Solving from Nature\u2014PPSN V, 5th\u00a0International Conference","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.: A new genetic local search algorithm for graph coloring. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature\u2014PPSN V, 5th\u00a0International Conference. Lecture Notes in Computer Science, vol.\u00a01498, pp.\u00a0745\u2013754. Springer, Berlin (1998)"},{"key":"9158_CR9","series-title":"Lecture Notes in Economics and Mathematical Systems","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd\u00a0edn. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin Heidelberg (2005)","edition":"2"},{"key":"9158_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of -Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of -Completeness. Freeman, New York (1979)"},{"key":"9158_CR11","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Walsh, T.: CSPLib: a benchmark library for constraints. Technical report APES-09-1999. Available from http:\/\/csplib.cs.strath.ac.uk\/ . A\u00a0shorter version appears in the Proceedings of the 5th International Conference on Principles and Practices of Constraint Programming (CP-99). LNCS, vol.\u00a01713, pp.\u00a0480\u2013481. Springer, Berlin (1999)","DOI":"10.1007\/978-3-540-48085-3_36"},{"issue":"1\u20133","key":"9158_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. 65(1\u20133), 223\u2013253 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9158_CR13","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighbourhood search. In: Vo\u00df, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp.\u00a0433\u2013458. Kluwer Academic, Dordrecht (1999)"},{"key":"9158_CR14","first-page":"121","volume-title":"CP-AI-OR 2002","author":"B. Hnich","year":"2002","unstructured":"Hnich, B., K\u0131z\u0131ltan, Z., Walsh, T.: Modelling a balanced academic curriculum problem. In: CP-AI-OR 2002, pp.\u00a0121\u2013131 (2002)"},{"key":"9158_CR15","unstructured":"Hoos, H.: Stochastic local search\u2014methods, models, application. Ph.D. thesis, Darmstadt University of Technology, Darmstadt, Germany (1999)"},{"key":"9158_CR16","volume-title":"Stochastic Local Search\u2014Foundations and Applications","author":"H.H. Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search\u2014Foundations and Applications. Morgan Kaufmann, San Mateo (2005)"},{"key":"9158_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/11785231_44","volume-title":"Artificial Intelligence and Soft Computing\u2014ICAISC 2006","author":"T. Lambert","year":"2006","unstructured":"Lambert, T., Castro, C., Monfroy, E., Saubion, F.: Solving the balanced academic curriculum problem with an hybridization of genetic algorithm and constraint propagation. In: Artificial Intelligence and Soft Computing\u2014ICAISC 2006. Lecture Notes in Computer Science, vol.\u00a04029, pp.\u00a0410\u2013419. Springer, Berlin (2006)"},{"key":"9158_CR18","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2001","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Applying iterated local search to the permutation flow shop problem. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. Kluwer Academic, Dordrecht (2001)"},{"key":"9158_CR19","volume-title":"Symcon\u201907, The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems","author":"J. Monette","year":"2007","unstructured":"Monette, J., Schaus, P., Zampelli, S., Deville, Y., Dupont, P.: A CP approach to the balanced academic curriculum problem. In: Benhamou, B., Choueiry, B., Hnich, B. (eds.) Symcon\u201907, The Seventh International Workshop on Symmetry and Constraint Satisfaction Problems (2007)"},{"issue":"1","key":"9158_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10479-010-0735-9","volume":"181","author":"T. M\u00fcller","year":"2010","unstructured":"M\u00fcller, T., Murray, K.: Comprehensive approach to student sectioning. Ann. Oper. Res. 181(1), 249\u2013269 (2010). doi: 10.1007\/s10479-010-0735-9","journal-title":"Ann. Oper. Res."},{"key":"9158_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/11564751_35","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2005, 11th International Conference, CP 2005, Proceedings","author":"G. Pesant","year":"2005","unstructured":"Pesant, G., R\u00e9gin, J.-C.: Spread: a balancing constraint based on statistics. In: van Beek, P. (ed.) Principles and Practice of Constraint Programming\u2014CP 2005, 11th International Conference, CP 2005, Proceedings, Sitges, Spain, 1\u20135 October 2005. Lecture Notes in Computer Science, vol.\u00a03709, pp.\u00a0460\u2013474. Springer, Berlin (2005)"},{"issue":"2","key":"9158_CR22","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13(2), 87\u2013127 (1999)","journal-title":"Artif. Intell. Rev."},{"key":"9158_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-540-77345-0_3","volume-title":"Proc. of the 6th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT-2006), Selected Papers","author":"A. Schaerf","year":"2007","unstructured":"Schaerf, A., Di Gaspero, L.: Measurability and reproducibility in timetabling research: discussion and proposals. In: Burke, E., Rudov\u00e1, H. (eds.) Proc. of the 6th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT-2006), Selected Papers. Lecture Notes in Computer Science, vol.\u00a03867, pp.\u00a040\u201349. Springer, Berlin-Heidelberg (2007)"},{"key":"9158_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-540-72397-4_19","volume-title":"CPAIOR","author":"P. Schaus","year":"2007","unstructured":"Schaus, P., Deville, Y., Dupont, P., R\u00e9gin, J.-C.: The deviation constraint. In: Hentenryck, P.V., Wolsey, L.A. (eds.) CPAIOR. Lecture Notes in Computer Science, vol.\u00a04510, pp.\u00a0260\u2013274. Springer, Berlin (2007)"},{"key":"9158_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/978-3-642-01929-6_19","volume-title":"CPAIOR","author":"P. Schaus","year":"2009","unstructured":"Schaus, P., Hentenryck, P.V., R\u00e9gin, J.-C.: Scalable load balancing in nurse to patient assignment problems. In: van Hoeve, W.J., Hooker, J.N. (eds.) CPAIOR. Lecture Notes in Computer Science, vol.\u00a05547, pp.\u00a0248\u2013262. Springer, Berlin (2009)"},{"issue":"4\u20135","key":"9158_CR26","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E.D. Taillard","year":"1991","unstructured":"Taillard, E.D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17(4\u20135), 443\u2013455 (1991)","journal-title":"Parallel Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9158-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9158-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9158-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T04:15:05Z","timestamp":1559967305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9158-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,27]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9158"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9158-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,27]]}}}