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

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.

Authors

Institutions

Publication Details

Journal
Annals of Operations Research
Published
2025-06-02
DOI
https://doi.org/10.1007/s10479-025-06678-6
Citations
1
Primary Topic
Higher Education Learning Practices
Type
article
Field-Weighted Citation Impact
8.93
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Filippo Bistaffa, Juan A. Rodríguez-Aguilar, Tomas Trescak, Roger X. Lera-Leri
1 citations
Annals of Operations Research
Higher Education Learning Practices
8.93
article

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

Filippo Bistaffa, Juan A. Rodríguez-Aguilar, Tomas Trescak, Roger X. Lera-Leri
article en
1 citations

Abstract

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.

Annals of Operations ResearchVol. 351(3)
Artificial Intelligence Research Institute (ES), Western Sydney University (AU)
Openalex Percentile: Top 4%
Higher Education Learning Practices
8.93
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.