IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v351y2025i3d10.1007_s10479-025-06678-6.html
   My bibliography  Save this article

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

Author

Listed:
  • Roger X. Lera-Leri

    (Artificial Intelligence Research Institute (IIIA-CSIC))

  • Filippo Bistaffa

    (Artificial Intelligence Research Institute (IIIA-CSIC))

  • Tomas Trescak

    (Western Sydney University)

  • Juan A. Rodríguez-Aguilar

    (Artificial Intelligence Research Institute (IIIA-CSIC))

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.

Suggested Citation

  • Roger X. Lera-Leri & Filippo Bistaffa & Tomas Trescak & Juan A. Rodríguez-Aguilar, 2025. "Computing job-tailored degree plans towards the acquisition of professional skills," Annals of Operations Research, Springer, vol. 351(3), pages 2095-2128, August.
    • Handle: RePEc:spr:annopr:v:351:y:2025:i:3:d:10.1007_s10479-025-06678-6
    DOI: 10.1007/s10479-025-06678-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-025-06678-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-025-06678-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    2. Ioannis T. Christou & Evgenia Vagianou & George Vardoulias, 2024. "Planning Courses for Student Success at the American College of Greece," Interfaces, INFORMS, vol. 54(4), pages 365-379, July.
    3. Ünal, Yusuf Ziya & Uysal, Özgür, 2014. "A new mixed integer programming model for curriculum balancing: Application to a Turkish university," European Journal of Operational Research, Elsevier, vol. 238(1), pages 339-347.
    4. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    5. Maria-Iuliana Dascalu & Constanta-Nicoleta Bodea & Monica Nastasia Mihailescu & Elena Alice Tanase & Patricia Ordoñez de Pablos, 2016. "Educational recommender systems and their application in lifelong learning," Behaviour and Information Technology, Taylor & Francis Journals, vol. 35(4), pages 290-297, April.
    6. Hartmann, Sönke & Briskorn, Dirk, 2022. "An updated survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 1-14.
    7. Mareike Karnebogen & Jürgen Zimmermann, 2024. "Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints," Annals of Operations Research, Springer, vol. 338(1), pages 173-192, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2024. "Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem," European Journal of Operational Research, Elsevier, vol. 317(1), pages 43-59.
    2. Gómez Sánchez, Mariam & Lalla-Ruiz, Eduardo & Fernández Gil, Alejandro & Castro, Carlos & Voß, Stefan, 2023. "Resource-constrained multi-project scheduling problem: A survey," European Journal of Operational Research, Elsevier, vol. 309(3), pages 958-976.
    3. Klein, Nicklas & Gnägi, Mario & Trautmann, Norbert, 2024. "Mixed-integer linear programming for project scheduling under various resource constraints," European Journal of Operational Research, Elsevier, vol. 319(1), pages 79-88.
    4. Rahman Torba & Stéphane Dauzère-Pérès & Claude Yugma & Cédric Gallais & Juliette Pouzet, 2024. "Solving a real-life multi-skill resource-constrained multi-project scheduling problem," Annals of Operations Research, Springer, vol. 338(1), pages 69-114, July.
    5. Guido Passage & Marjan van den Akker & Han Hoogeveen, 2025. "A new, efficient approach to speed up local search by estimating the solution quality: an application to stochastic, parallel machine scheduling," Journal of Heuristics, Springer, vol. 31(3), pages 1-31, September.
    6. Elmar Steiner & Ulrich Pferschy & Andrea Schaerf, 2025. "Curriculum-based university course timetabling considering individual course of studies," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 33(1), pages 277-314, March.
    7. Pejman Peykani & Jafar Gheidar-Kheljani & Sheida Shahabadi & Seyyed Hassan Ghodsypour & Mojtaba Nouri, 2023. "A two-phase resource-constrained project scheduling approach for design and development of complex product systems," Operational Research, Springer, vol. 23(1), pages 1-25, March.
    8. He, Yukang & Jia, Tao & Zheng, Weibo, 2023. "Tabu search for dedicated resource-constrained multiproject scheduling to minimise the maximal cash flow gap under uncertainty," European Journal of Operational Research, Elsevier, vol. 310(1), pages 34-52.
    9. Kasapidis, Gregory A. & Paraskevopoulos, Dimitris C. & Mourtos, Ioannis & Repoussis, Panagiotis P., 2025. "A unified solution framework for flexible job shop scheduling problems with multiple resource constraints," European Journal of Operational Research, Elsevier, vol. 320(3), pages 479-495.
    10. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2022. "Integer Optimization Model and Algorithm for the Stem Cell Culturing Problem," Omega, Elsevier, vol. 108(C).
    11. Schulze, Philipp & Scholl, Armin & Walter, Rico, 2024. "R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines," European Journal of Operational Research, Elsevier, vol. 312(1), pages 38-55.
    12. Alessandro Hill & Andrea J. Brickey & Italo Cipriano & Marcos Goycoolea & Alexandra Newman, 2022. "Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3042-3058, November.
    13. Marinos Aristotelous & Andreas C. Nearchou, 2025. "h-NSDE—A Solution Algorithm for the Multi-objective Resource Leveling Problem," SN Operations Research Forum, Springer, vol. 6(1), pages 1-22, March.
    14. Asbach, Lasse & Dorndorf, Ulrich & Pesch, Erwin, 2009. "Analysis, modeling and solution of the concrete delivery problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 820-835, March.
    15. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    16. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    17. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    18. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    19. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    20. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:351:y:2025:i:3:d:10.1007_s10479-025-06678-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.