{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T18:11:30Z","timestamp":1762971090683,"version":"3.45.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111074","type":"print"},{"value":"9783032111081","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:00:00Z","timestamp":1762905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T00:00:00Z","timestamp":1762905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11108-1_3","type":"book-chapter","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T18:03:32Z","timestamp":1762970612000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Schedules Need to\u00a0be Fair Over Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9916-9011","authenticated-orcid":false,"given":"Marie-Louise","family":"Lackner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,12]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/JAGM.1998.0953","volume":"29","author":"M Ajtai","year":"1998","unstructured":"Ajtai, M., Aspnes, J., Naor, M., Rabani, Y., Schulman, L.J., Waarts, O.: Fairness in scheduling. J. Algorithms 29(2), 306\u2013357 (1998). https:\/\/doi.org\/10.1006\/JAGM.1998.0953","journal-title":"J. Algorithms"},{"key":"3_CR2","unstructured":"Amanatidis, G., Barrot, N., Lang, J., Markakis, E., Ries, B.: Multiple referenda and multiwinner elections using hamming distances: Complexity and manipulability. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, 4\u20138 May 2015, pp. 715\u2013723. ACM (2015)"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J Van den Bergh","year":"2013","unstructured":"Van den Bergh, J., Beli\u00ebn, J., De Bruecker, P., Demeulemeester, E., De Boeck, L.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367\u2013385 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/OPRE.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V.F., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17\u201331 (2011). https:\/\/doi.org\/10.1287\/OPRE.1100.0865","journal-title":"Oper. Res."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"B\u0142a\u017cewicz, J., Ecker, K.H., Pesch, E., Schmidt, G\u00fcnter\u00a0Sterna, M., Weglarz, J.: Handbook on Scheduling: From Theory to Practice. Springer, Cham (2019)","DOI":"10.1007\/978-3-319-99849-7"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.): Handbook of Computational Social Choice. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"EK Burke","year":"2004","unstructured":"Burke, E.K., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. J. Sched. 7, 441\u2013499 (2004)","journal-title":"J. Sched."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. In: Proceedings of the 2016 ACM Conference on Economics and Computation (EC), pp. 305\u2013322. ACM (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Chandak, N., Goel, S., Peters, D.: Proportional aggregation of preferences for sequential decision making. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 9, pp. 9573\u20139581 (2024). https:\/\/doi.org\/10.1609\/aaai.v38i9.28813","DOI":"10.1609\/aaai.v38i9.28813"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Cole, R., Gkatzelis, V.: Approximating the Nash social welfare with indivisible items. In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC), pp. 371\u2013380. ACM (2015). https:\/\/doi.org\/10.1145\/2746539.2746584","DOI":"10.1145\/2746539.2746584"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2014.10.038","volume":"243","author":"P De Bruecker","year":"2015","unstructured":"De Bruecker, P., Van den Bergh, J., Beli\u00ebn, J., Demeulemeester, E.: Workforce planning incorporating skills: state of the art. Eur. J. Oper. Res. 243(1), 1\u201316 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.10.038","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/S002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectr. 22(4), 425\u2013460 (2000). https:\/\/doi.org\/10.1007\/S002910000046","journal-title":"OR Spectr."},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Elkind, E., Neoh, T.Y., Teh, N.: Temporal elections: welfare, strategyproofness, and proportionality. In: ECAI 2024 - 27th European Conference on Artificial Intelligence, Santiago de Compostela, Spain, 19\u201324 October 2024, vol.\u00a0392, pp. 3292\u20133299. IOS Press (2024). https:\/\/doi.org\/10.3233\/FAIA240877","DOI":"10.3233\/FAIA240877"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Elkind, E., Obraztsova, S., Teh, N.: Temporal fairness in multiwinner voting. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 20, pp. 22633\u201322640 (2024). https:\/\/doi.org\/10.1609\/aaai.v38i20.30273","DOI":"10.1609\/aaai.v38i20.30273"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Ernst, A., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3\u201327 (2004). https:\/\/doi.org\/10.1016\/S0377-2217(03)00095-X","DOI":"10.1016\/S0377-2217(03)00095-X"},{"key":"3_CR16","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner voting: a new challenge for social choice theory. In: Endriss, U. (ed.) Trends in Computational Social Choice, chap.\u00a02, pp. 27\u201347. AI Access (2017)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Freeman, R., Zahedi, S.M., Conitzer, V.: Fair and efficient social choice in dynamic settings. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-2017), pp. 4580\u20134587. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/639"},{"issue":"6","key":"3_CR18","doi-asserted-by":"publisher","first-page":"2609","DOI":"10.1007\/s10670-020-00318-0","volume":"87","author":"P Harrenstein","year":"2022","unstructured":"Harrenstein, P., Lackner, M.L., Lackner, M.: A mathematical analysis of an election system proposed by Gottlob Frege. Erkenntnis 87(6), 2609\u20132644 (2022)","journal-title":"Erkenntnis"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/J.EJOR.2024.12.052","volume":"323","author":"D Hermelin","year":"2025","unstructured":"Hermelin, D., Molter, H., Niedermeier, R., Pinedo, M.L., Shabtay, D.: Fairness in repetitive scheduling. Eur. J. Oper. Res. 323(3), 724\u2013738 (2025). https:\/\/doi.org\/10.1016\/J.EJOR.2024.12.052","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Igarashi, A., Lackner, M., Nardi, O., Novaro, A.: Repeated fair allocation of indivisible items. In: Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024), pp. 9781\u20139789. AAAI Press (2024)","DOI":"10.1609\/aaai.v38i9.28837"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1002\/ett.4460080106","volume":"8","author":"FP Kelly","year":"1997","unstructured":"Kelly, F.P.: Charging and rate control for elastic traffic. Eur. Trans. Telecommun. 8(1), 33\u201337 (1997). https:\/\/doi.org\/10.1002\/ett.4460080106","journal-title":"Eur. Trans. Telecommun."},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Kletzander, L., Musliu, N.: Solving the general employee scheduling problem. Comput. Oper. Res. 113 (2020). https:\/\/doi.org\/10.1016\/J.COR.2019.104794","DOI":"10.1016\/J.COR.2019.104794"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Lackner, M.: Perpetual voting: fairness in long-term decision making. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pp. 2103\u20132110. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5584"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Lackner, M., Maly, J.: Proportional decisions in perpetual voting. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023), pp. 5722\u20135729. AAAI Press (2023)","DOI":"10.1609\/aaai.v37i5.25710"},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/S11047-022-09911-4","volume":"22","author":"L Lai","year":"2023","unstructured":"Lai, L., Fiaschi, L., Cococcioni, M., Deb, K.: Pure and mixed lexicographic-paretian many-objective optimization: state of the art. Nat. Comput. 22(2), 227\u2013242 (2023). https:\/\/doi.org\/10.1007\/S11047-022-09911-4","journal-title":"Nat. Comput."},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Lan, T., Kao, D.T.H., Chiang, M., Sabharwal, A.: An axiomatic theory of fairness in network resource allocation. In: INFOCOM 2010. 29th IEEE International Conference on Computer Communications, San Diego, CA, USA, 15\u201319 March 2010, pp. 1343\u20131351. IEEE (2010). https:\/\/doi.org\/10.1109\/INFCOM.2010.5461911","DOI":"10.1109\/INFCOM.2010.5461911"},{"issue":"3","key":"3_CR27","first-page":"203","volume":"13","author":"B Li","year":"2005","unstructured":"Li, B., Jamin, S., Shin, K.G.: Fair resource allocation in computing systems. J. Comput. Inf. Technol. 13(3), 203\u2013216 (2005)","journal-title":"J. Comput. Inf. Technol."},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. In: Lai, W.S., Cooper, R.B. (eds.) Performance and Control of Network Systems II, vol.\u00a03530, pp. 55 \u2013 63. International Society for Optics and Photonics, SPIE (1998). https:\/\/doi.org\/10.1117\/12.325891","DOI":"10.1117\/12.325891"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Axioms of Cooperative Decision Making. Econometric Society Monographs. Cambridge University Press (1988)","DOI":"10.1017\/CCOL0521360552"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Musliu, N., G\u00e4rtner, J., Slany, W.: Efficient generation of rotating workforce schedules. Discrete Appl. Math. 118(1), 85\u201398 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00258-X. Special Issue devoted to the ALIO-EURO Workshop on Applied Combinatorial Optimization","DOI":"10.1016\/S0166-218X(01)00258-X"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"56504","DOI":"10.1109\/ACCESS.2022.3177280","volume":"10","author":"CM Ngoo","year":"2022","unstructured":"Ngoo, C.M., Goh, S.L., Sabar, N.R., Abdullah, S., Kendall, G., et al.: A survey of the nurse rostering solution methodologies: the state-of-the-art and emerging trends. IEEE Access 10, 56504\u201356524 (2022)","journal-title":"IEEE Access"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Parente, M., Figueira, G., Amorim, P., Marques, A.: Production scheduling in the context of industry 4.0: review and trends. Int. J. Prod. Res. 58(17), 5401\u20135431 (2020). https:\/\/doi.org\/10.1080\/00207543.2020.1718794","DOI":"10.1080\/00207543.2020.1718794"},{"key":"3_CR33","unstructured":"Pascual, F., Rzadca, K., Skowron, P.: Collective schedules: scheduling meets computational social choice. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, 10\u201315 July 2018, pp. 667\u2013675 (2018)"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 6 edn. Springer, Cham (2022). Accessed 14 Dec 2022, 698 pages","DOI":"10.1007\/978-3-031-05921-6"},{"key":"3_CR35","doi-asserted-by":"publisher","DOI":"10.4159\/9780674042605","volume-title":"A Theory of Justice","author":"J Rawls","year":"1971","unstructured":"Rawls, J.: A Theory of Justice. Harvard University Press, Cambridge (1971)"},{"key":"3_CR36","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol.\u00a02. Elsevier (2006)"},{"issue":"2","key":"3_CR37","first-page":"1","volume":"55","author":"U Schwiegelshohn","year":"2022","unstructured":"Schwiegelshohn, U.: Approximation algorithms for machine scheduling: 20 years of recent progress. ACM Comput. Surv. (CSUR) 55(2), 1\u201338 (2022)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"3_CR38","volume-title":"Collective Choice and Social Welfare","author":"A Sen","year":"1970","unstructured":"Sen, A.: Collective Choice and Social Welfare. Holden-Day, San Francisco (1970)"},{"issue":"1","key":"3_CR39","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.sorms.2010.07.002","volume":"16","author":"A Wierman","year":"2011","unstructured":"Wierman, A.: Fairness and scheduling in single server queues. Surv. Oper. Res. Manag. Sci. 16(1), 39\u201348 (2011). https:\/\/doi.org\/10.1016\/j.sorms.2010.07.002","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decisionmaking. Man Cybern. IEEE Trans. Syst. (1988)","DOI":"10.1109\/21.87068"}],"container-title":["Lecture Notes in Computer Science","Digital Humanism"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11108-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T18:03:35Z","timestamp":1762970615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11108-1_3"}},"subtitle":["Position Paper"],"short-title":[],"issued":{"date-parts":[[2025,11,12]]},"ISBN":["9783032111074","9783032111081"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11108-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,12]]},"assertion":[{"value":"12 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"DIGHUM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Interdisciplinary Science and Research Conference on Digital Humanism","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dighum2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caiml.org\/dighum\/\/dighum-res\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}