{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:37:20Z","timestamp":1759847840614},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,14]],"date-time":"2014-02-14T00:00:00Z","timestamp":1392336000000},"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":[[2016,4]]},"DOI":"10.1007\/s10479-014-1553-2","type":"journal-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T07:21:50Z","timestamp":1392276110000},"page":"171-188","source":"Crossref","is-referenced-by-count":14,"title":["Fairness in academic course timetabling"],"prefix":"10.1007","volume":"239","author":[{"given":"Moritz","family":"M\u00fchlenthaler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Wanka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,14]]},"reference":[{"key":"1553_CR1","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E. K., & McCollum, B. (2007). A hybrid evolutionary approach to the university course timetabling problem. In IEEE congress on evolutionary computation (CEC) (pp. 1764\u20131768). doi: 10.1109\/CEC.2007.4424686 .","DOI":"10.1109\/CEC.2007.4424686"},{"key":"1553_CR2","unstructured":"As\u00edn Acha, R., & Nieuwenhuis, R. (2010). Curriculum-based course timetabling with SAT and MaxSAT. In Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT) (pp. 42\u201356)."},{"key":"1553_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TEVC.2007.900837","volume":"12","author":"S. Bandyopadhyay","year":"2008","unstructured":"Bandyopadhyay, S., Saha, S., Maulik, U., & Deb, K. (2008). A simulated annealing-based multiobjective optimization algorithm: AMOSA. IEEE Transactions on Evolutionary Computation, 12, 269\u2013283. doi: 10.1109\/TEVC.2007.900837 .","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"1553_CR4","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/s00453-001-0119-2","volume":"33","author":"Y. Bartal","year":"2002","unstructured":"Bartal, Y., Farach-Colton, M., Yooseph, S., & Zhang, L. (2002). Fast, fair and frugal bandwidth allocation in ATM networks. Algorithmica, 33(3), 272\u2013286. doi: 10.1007\/s00453-001-0119-2 .","journal-title":"Algorithmica"},{"key":"1553_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10951-011-0224-2","volume":"15","author":"R. Bellio","year":"2012","unstructured":"Bellio, R., DiGaspero, L., & Schaerf, A. (2012). Design and statistical analysis of a hybrid local search algorithm for course timetabling. Journal of Scheduling, 15, 49\u201361. doi: 10.1007\/s10951-011-0224-2 .","journal-title":"Journal of Scheduling"},{"key":"1553_CR6","volume-title":"Data networks, 2nd edn","author":"D.P. Bertsekas","year":"1992","unstructured":"Bertsekas, D. P., & Gallager, R. (1992). Data networks (2nd ed.). Upper Saddle River: Prentice Hall."},{"issue":"1","key":"1553_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D. Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V. F., & Trichakis, N. (2011). The price of fairness. Operations Research, 59(1), 17\u201331. doi: 10.1287\/opre.1100.0865 .","journal-title":"Operations Research"},{"key":"1553_CR8","doi-asserted-by":"crossref","unstructured":"Bullnheimer, B. (1998). An examination scheduling model to maximize students study time. In Proceedings of the 2nd international conference on the practice and theory of automated timetabling (PATAT) (pp. 78\u201391). doi: 10.1007\/BFb0055882 .","DOI":"10.1007\/BFb0055882"},{"issue":"1","key":"1553_CR10","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2010.01.044","volume":"206","author":"E.K. Burke","year":"2010","unstructured":"Burke, E. K., Eckersley, A. J., McCollum, B., Petrovic, S., & Qu, R. (2010). Hybrid variable neighbourhood approaches to university exam timetabling. European Journal of Operational Research, 206(1), 46\u201353. doi: 10.1016\/j.ejor.2010.01.044 .","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1553_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10479-010-0828-5","volume":"194","author":"E.K. Burke","year":"2011","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2011). A branch-and-cut procedure for the Udine Course Timetabling problem. Annals of Operations Research, 194(1), 71\u201387. doi: 10.1007\/s10479-010-0828-5 .","journal-title":"Annals of Operations Research"},{"issue":"1","key":"1553_CR9","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 educational timetabling problems. European Journal of Operational Research, 176(1), 177\u2013192. doi: 10.1016\/j.ejor.2005.08.012 .","journal-title":"European Journal of Operational Research"},{"key":"1553_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0169-7552(89)90019-6","volume":"17","author":"D.M. Chiu","year":"1989","unstructured":"Chiu, D. M., & Jain, R. (1989). Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN Systems, 17, 1\u201314. doi: 10.1016\/0169-7552(89)90019-6 .","journal-title":"Computer Networks and ISDN Systems"},{"key":"1553_CR13","doi-asserted-by":"crossref","unstructured":"Constantino, A. A., de Melo, E. L., Romao, W., & Landa-Silva, D. (2011). A heuristic algorithm for nurse scheduling with balanced preference satisfaction. In Proceedings of the IEEE symposium on computational intelligence in scheduling (CISched) (pp. 39\u201345). doi: 10.1109\/SCIS.2011.5976549 .","DOI":"10.1109\/SCIS.2011.5976549"},{"key":"1553_CR17","unstructured":"Di Gaspero, L., McCollum, B., Schaerf, A. (2007). The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (Track 3). Tech. Rep. QUB\/IEEE\/Tech\/ITC2007\/CurriculumCTT\/v1.0\/1, School of Electronics, Electrical Engineering and Computer Science, Queens University, Belfast (UK)."},{"key":"1553_CR14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. Di Gaspero","year":"2006","unstructured":"Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modelling and Algorithms, 5, 65\u201389. doi: 10.1007\/s10852-005-9032-z .","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"1553_CR15","doi-asserted-by":"crossref","unstructured":"Di Gaspero, L., & Schaerf, A. (2008). Hybrid local search techniques for the generalized balanced academic curriculum problem. In Proceedings of the 5th international workshop on hybrid metaheuristics (HM) (pp. 146\u2013157). doi: 10.1007\/978-3-540-88439-2_11 .","DOI":"10.1007\/978-3-540-88439-2_11"},{"key":"1553_CR16","unstructured":"Di Gaspero, L., & Schaerf, A. (2012). Curriculum-based course timetabling site. http:\/\/satt.diegm.uniud.it\/ctt\/ ."},{"issue":"3","key":"1553_CR18","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J., & Fulkerson, D. (1970). Bottleneck extrema. Journal of Combinatorial Theory, 8(3), 299\u2013306. doi: 10.1016\/S0021-9800(70)80083-7 .","journal-title":"Journal of Combinatorial Theory"},{"key":"1553_CR19","doi-asserted-by":"crossref","unstructured":"Feldman, A., & Serrano, R. (2006). Welfare economics and social choice theory (2nd ed.). New York, NY: Springer. doi: 10.1007\/0-387-29368-X .","DOI":"10.1007\/0-387-29368-X"},{"issue":"121","key":"1553_CR20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.2307\/2223319","volume":"31","author":"C. Gini","year":"1921","unstructured":"Gini, C. (1921). Measurement of inequality of incomes. The Economic Journal, 31(121), 124\u2013126. doi: 10.2307\/2223319 .","journal-title":"The Economic Journal"},{"key":"1553_CR21","unstructured":"Jain, R. K., Chiu, D. M. W., & Hawe, W. R. (1984). A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. Tech. Rep. DEC-TR-301, Digital Equipment Corporation."},{"key":"1553_CR22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"F. Kelly","year":"1998","unstructured":"Kelly, F., Maulloo, A., & Tan, D. (1998). Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49, 237\u2013252. doi: 10.1057\/palgrave.jors.2600523 .","journal-title":"Journal of the Operational Research Society"},{"issue":"4598","key":"1553_CR23","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671\u2013680. doi: 10.1126\/science.220.4598.671 .","journal-title":"Science"},{"issue":"1","key":"1553_CR24","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jcss.2001.1752","volume":"63","author":"J. Kleinberg","year":"2001","unstructured":"Kleinberg, J., Rabani, Y., & Tardos, \u00c9. (2001). Fairness in routing and load balancing. Journal of Computer and System Sciences, 63(1), 2\u201320. doi: 10.1006\/jcss.2001.1752 .","journal-title":"Journal of Computer and System Sciences"},{"key":"1553_CR25","doi-asserted-by":"crossref","unstructured":"Kostuch, P. (2004). The university course timetabling problem with a three-phase approach. In Proceedings of the 5th international conference on the practice and theory of automated timetabling (PATAT) (pp. 109\u2013125). doi: 10.1007\/11593577_7 .","DOI":"10.1007\/11593577_7"},{"issue":"1","key":"1553_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0305-0483(94)90006-X","volume":"22","author":"C. Koulamas","year":"1994","unstructured":"Koulamas, C., Antony, S., & Jaen, R. (1994). A survey of simulated annealing applications to operations research problems. Omega, 22(1), 41\u201356. doi: 10.1016\/0305-0483(94)90006-X .","journal-title":"Omega"},{"key":"1553_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated annealing: Theory and applications","author":"P.J.M.V. Laarhoven","year":"1987","unstructured":"Laarhoven, P. J. M. V., & Aarts, E. H. L. (1987). Simulated annealing: Theory and applications. Dordrecht: Kluwer Academic Publishers."},{"key":"1553_CR28","first-page":"1","volume":"194","author":"G. Lach","year":"2010","unstructured":"Lach, G., & L\u00fcbbecke, M. E. (2010). Curriculum based course timetabling: New solutions to Udine benchmark instances. Annals of Operations Research, 194, 1\u201318. doi: 10.1007\/s10479-010-0700-7 .","journal-title":"Annals of Operations Research"},{"key":"1553_CR29","volume-title":"Probability and statistics for modern engineering","author":"L. Lapin","year":"1990","unstructured":"Lapin, L. (1990). Probability and statistics for modern engineering. Long Grove: Waveland Press."},{"issue":"1","key":"1553_CR30","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z. L\u00fc","year":"2010","unstructured":"L\u00fc, Z., & Hao, J. K. (2010). Adaptive tabu search for course timetabling. European Journal of Operational Research, 200(1), 235\u2013244. doi: 10.1016\/j.ejor.2008.12.007 .","journal-title":"European Journal of Operational Research"},{"issue":"16","key":"1553_CR31","doi-asserted-by":"crossref","first-page":"6674","DOI":"10.1016\/j.eswa.2013.06.019","volume":"40","author":"S. Martin","year":"2013","unstructured":"Martin, S., Ouelhadj, D., Smet, P., & Vanden Berghe, G., & \u00d6zcan, E. (2013). Cooperative search for fair nurse rosters. Expert Systems with Applications, 40(16), 6674\u20136683, doi: 10.1016\/j.eswa.2013.06.019 .","journal-title":"Expert Systems with Applications"},{"key":"1553_CR32","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B. McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., Di Gaspero, L., Qu, R., & Burke, E. K. (2010). Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22, 120\u2013130. doi: 10.1287\/ijoc.1090.0320 .","journal-title":"INFORMS Journal on Computing"},{"key":"1553_CR33","doi-asserted-by":"crossref","unstructured":"Merlot, L. T. G., Boland, N., Hughes, B. D., & Stuckey, P. J. (2002). A hybrid algorithm for the examination timetabling problem. In Proceedings of the 4th international conference on the practice and theory of automated timetabling (PATAT) (pp. 207\u2013231). doi: 10.1007\/978-3-540-45157-0_14 .","DOI":"10.1007\/978-3-540-45157-0_14"},{"key":"1553_CR34","unstructured":"M\u00fchlenthaler, M., & Wanka, R. (2012). Fairness in academic timetabling. In Proceedings of the 9th international conference on the practice and theory of automated timetabling (PATAT) (pp. 114\u2013130)."},{"key":"1553_CR35","unstructured":"Muklason, A., Parkes, A. J., McCollum, B., & \u00d6zcan, E. (2013). Initial results on fairness in examination timetabling. In Proceedings of the 6th multidisciplinary international conference on scheduling: Theory and applications (MISTA) (pp. 777\u2013780)."},{"issue":"1","key":"1553_CR36","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T. M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). ITC2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429\u2013446. doi: 10.1007\/s10479-009-0644-y .","journal-title":"Annals of Operations Research"},{"key":"1553_CR37","doi-asserted-by":"crossref","unstructured":"Ogryczak, W. (2010). Bicriteria models for fair and efficient resource allocation. In Proceedings of the 2nd international conference on social informatics (SocInfo) (pp. 140\u2013159). doi: 10.1007\/978-3-642-16567-2_11 .","DOI":"10.1007\/978-3-642-16567-2_11"},{"key":"1553_CR38","first-page":"427","volume":"33","author":"W. Ogryczak","year":"2004","unstructured":"Ogryczak, W., & Wierzbicki, A. (2004). On multi-criteria approaches to bandwidth allocation. Control and Cybernetics, 33, 427\u2013448.","journal-title":"Control and Cybernetics"},{"issue":"2","key":"1553_CR39","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/nav.20446","volume":"58","author":"A.P. Punnen","year":"2011","unstructured":"Punnen, A. P., & Zhang, R. (2011). Quadratic bottleneck problems. Naval Research Logistics (NRL), 58(2), 153\u2013164. doi: 10.1002\/nav.20446 .","journal-title":"Naval Research Logistics (NRL)"},{"key":"1553_CR40","doi-asserted-by":"crossref","DOI":"10.4159\/9780674042582","volume-title":"A theory of justice, revised edn","author":"J. Rawls","year":"1999","unstructured":"Rawls, J. (1999). A theory of justice, revised edn. Cambridge: Belknap Press of Harvard University Press."},{"issue":"2","key":"1553_CR41","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1016\/j.ejor.2006.12.047","volume":"185","author":"R.M. Salles","year":"2008","unstructured":"Salles, R. M., & Barria, J. A. (2008). Lexicographic maximin optimisation for fair bandwidth allocation in computer networks. European Journal of Operational Research, 185(2), 778\u2013794. doi: 10.1016\/j.ejor.2006.12.047 .","journal-title":"European Journal of Operational Research"},{"key":"1553_CR42","unstructured":"Smet, P., Martin, S., & Ouelhadj, D., \u00d6zcan, E., & Vanden Berghe, G. (2012). Investigation of fairness measures for nurse rostering. In Proceedings of the 9th international conference on the practice and theory of automated timetabling (PATAT) (pp. 369\u2013372)."},{"key":"1553_CR43","unstructured":"Soomer, M. J., & Koole, G. M. (2008). Fairness in the aircraft landing problem. In Proceedings of the Anna Valicek competition 2008."},{"key":"1553_CR44","doi-asserted-by":"crossref","unstructured":"Thompson, J., & Dowsland, K. A. (1996). General cooling schedules for a simulated annealing based timetabling system. In Proceedings of the 1st international confernce on the practice and theory of automated timetabling (PATAT) (pp. 345\u2013363). doi: 10.1007\/3-540-61794-9_70 .","DOI":"10.1007\/3-540-61794-9_70"},{"issue":"7-8","key":"1553_CR45","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"J.M. Thompson","year":"1998","unstructured":"Thompson, J. M., & Dowsland, K. A. (1998). A robust simulated annealing based examination timetabling system. Computers & Operations Research, 25(7\u20138), 637\u2013648. doi: 10.1016\/S0305-0548(97)00101-9 .","journal-title":"Computers and Operations Research,"},{"key":"1553_CR46","doi-asserted-by":"crossref","unstructured":"Tuga, M., Berretta, R., & Mendes, A. (2007). A hybrid simulated annealing with Kempe chain neighborhood for the university timetabling problem. In Proceedings of the 6th ACIS international conference on computer and information science (ACIS-ICIS) (pp. 400\u2013405). doi: 10.1109\/ICIS.2007.25 .","DOI":"10.1109\/ICIS.2007.25"},{"issue":"6","key":"1553_CR47","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F. Wilcoxon","year":"1945","unstructured":"Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80\u201383.","journal-title":"Biometrics Bulletin"},{"issue":"1","key":"1553_CR48","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"R.R. Yager","year":"1988","unstructured":"Yager, R. R. (1988). On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Transactions on Systems, Man and Cybernetics, 18(1), 183\u2013190, doi: 10.1109\/21.87068 .","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1553-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1553-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1553-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T13:49:06Z","timestamp":1648302546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1553-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,14]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["1553"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1553-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,14]]}}}