Computing job-tailored degree plans towards the acquisition of professional skills

IF 4.5 3区 管理学 Q1 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Roger X. Lera-Leri, Filippo Bistaffa, Tomas Trescak, Juan A. Rodríguez-Aguilar
{"title":"Computing job-tailored degree plans towards the acquisition of professional skills","authors":"Roger X. Lera-Leri,&nbsp;Filippo Bistaffa,&nbsp;Tomas Trescak,&nbsp;Juan A. Rodríguez-Aguilar","doi":"10.1007/s10479-025-06678-6","DOIUrl":null,"url":null,"abstract":"<div><p>Sensibly planning the subjects to study during a university degree is one of the most crucial tasks that impact the future professional life of a student. Nonetheless, to the best of our knowledge, no automated solution is available for students who want to plan their desired degree path and maximize the skills required by desired or target job(s). In this paper, we consider the <i>Degree Planning Problem</i> (DPP), which aims at computing degree plans composed of university subjects for students during the completion of an undergraduate degree. Specifically, we aim to obtain the best set of skills matching the requirements of students’ preferred job(s). To achieve this objective, we propose a flexible and scalable approach that solves the DPP in real-time by means of a non-trivial formalization as an optimization problem that can be solved with standard solvers. Finally, we employ real data from our University’s Bachelor in Information and Communications Technology to show, through several use cases, that our approach can be a valuable decision-support tool for students and curriculum designers.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"351 3","pages":"2095 - 2128"},"PeriodicalIF":4.5000,"publicationDate":"2025-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06678-6.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Operations Research","FirstCategoryId":"91","ListUrlMain":"https://link.springer.com/article/10.1007/s10479-025-06678-6","RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Sensibly planning the subjects to study during a university degree is one of the most crucial tasks that impact the future professional life of a student. Nonetheless, to the best of our knowledge, no automated solution is available for students who want to plan their desired degree path and maximize the skills required by desired or target job(s). In this paper, we consider the Degree Planning Problem (DPP), which aims at computing degree plans composed of university subjects for students during the completion of an undergraduate degree. Specifically, we aim to obtain the best set of skills matching the requirements of students’ preferred job(s). To achieve this objective, we propose a flexible and scalable approach that solves the DPP in real-time by means of a non-trivial formalization as an optimization problem that can be solved with standard solvers. Finally, we employ real data from our University’s Bachelor in Information and Communications Technology to show, through several use cases, that our approach can be a valuable decision-support tool for students and curriculum designers.

计算机职业定制学位计划旨在获得专业技能
在大学期间合理规划学习科目是影响学生未来职业生涯的最重要任务之一。尽管如此,据我们所知,对于那些想要规划自己想要的学位路径并最大限度地提高期望或目标工作所需技能的学生来说,没有自动化的解决方案可用。在本文中,我们考虑学位计划问题(DPP),其目的是计算学生在完成本科学位期间由大学学科组成的学位计划。具体来说,我们的目标是获得符合学生首选工作要求的最佳技能。为了实现这一目标,我们提出了一种灵活且可扩展的方法,通过非平凡形式化作为可以用标准求解器解决的优化问题来实时解决DPP。最后,我们使用了来自我校信息与通信技术学士学位的真实数据,通过几个用例表明,我们的方法可以成为学生和课程设计师有价值的决策支持工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Annals of Operations Research
Annals of Operations Research 管理科学-运筹学与管理科学
CiteScore
7.90
自引率
16.70%
发文量
596
审稿时长
8.4 months
期刊介绍: The Annals of Operations Research publishes peer-reviewed original articles dealing with key aspects of operations research, including theory, practice, and computation. The journal publishes full-length research articles, short notes, expositions and surveys, reports on computational studies, and case studies that present new and innovative practical applications. In addition to regular issues, the journal publishes periodic special volumes that focus on defined fields of operations research, ranging from the highly theoretical to the algorithmic and the applied. These volumes have one or more Guest Editors who are responsible for collecting the papers and overseeing the refereeing process.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信