IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i19p3025-d1487749.html
   My bibliography  Save this article

A Robust Human–Machine Framework for Project Portfolio Selection

Author

Listed:
  • Hang Chen

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Nannan Zhang

    (Finance and Economics Pearl River College, Tianjin University, Tianjin 300345, China)

  • Yajie Dou

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

  • Yulong Dai

    (College of Systems Engineering, National University of Defense Technology, Changsha 410073, China)

Abstract

Based on the project portfolio selection and scheduling problem (PPSS), the development of a systematic and scientific project scheduling plan necessitates comprehensive consideration of individual preferences and multiple realistic constraints, rendering it an NP-hard problem. Simultaneously, accurately and swiftly evaluating the value of projects as a complex entity poses a challenging issue that requires urgent attention. This paper introduces a novel qualitative evaluation-based project value assessment process that significantly reduces the cost and complexity of project value assessment, upon which a preference-based deep reinforcement learning method is presented for computing and solving project subsets and time scheduling plans. This paper first determines the key parameter values of the algorithm through specific examples. Then, using the method of controlling variables, it explores the sensitivity of the algorithm to changes in problem size and dimensionality. Finally, the proposed algorithm is compared with two classical algorithms and two heuristic algorithms across different instances. The experimental results demonstrate that the proposed algorithm exhibits higher effectiveness and accuracy.

Suggested Citation

  • Hang Chen & Nannan Zhang & Yajie Dou & Yulong Dai, 2024. "A Robust Human–Machine Framework for Project Portfolio Selection," Mathematics, MDPI, vol. 12(19), pages 1-18, September.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:19:p:3025-:d:1487749
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/19/3025/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/19/3025/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Burke, Edmund K. & Curtois, Tim, 2014. "New approaches to nurse rostering benchmark instances," European Journal of Operational Research, Elsevier, vol. 237(1), pages 71-81.
    2. Dyer, M. E. & Proll, L. G., 1982. "An improved vertex enumeration algorithm," European Journal of Operational Research, Elsevier, vol. 9(4), pages 359-368, April.
    3. Edmund K. Burke & Timothy Curtois & Rong Qu & Greet Vanden Berghe, 2013. "A Time Predefined Variable Depth Search for Nurse Rostering," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 411-419, August.
    4. Roger Shepard, 1957. "Stimulus and response generalization: A stochastic model relating generalization to distance in psychological space," Psychometrika, Springer;The Psychometric Society, vol. 22(4), pages 325-345, December.
    5. Yin, Xuanpeng & Xu, Xuanhua & Pan, Bin, 2021. "Selection of Strategy for Large Group Emergency Decision-making based on Risk Measurement," Reliability Engineering and System Safety, Elsevier, vol. 208(C).
    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. Frederik Knust & Lin Xie, 2019. "Simulated annealing approach to nurse rostering benchmark and real-world instances," Annals of Operations Research, Springer, vol. 272(1), pages 187-216, January.
    2. Roger Shepard, 1974. "Representation of structure in similarity data: Problems and prospects," Psychometrika, Springer;The Psychometric Society, vol. 39(4), pages 373-421, December.
    3. Emir Demirović & Nysret Musliu & Felix Winter, 2019. "Modeling and solving staff scheduling with partial weighted maxSAT," Annals of Operations Research, Springer, vol. 275(1), pages 79-99, April.
    4. Range, Troels Martin & Kozlowski, Dawid & Petersen, Niels Chr., 2019. "Dynamic job assignment: A column generation approach with an application to surgery allocation," European Journal of Operational Research, Elsevier, vol. 272(1), pages 78-93.
    5. Michael Brusco & Stephanie Stahl, 2001. "Compact integer-programming models for extracting subsets of stimuli from confusion matrices," Psychometrika, Springer;The Psychometric Society, vol. 66(3), pages 405-419, September.
    6. Václavík, Roman & Novák, Antonín & Šůcha, Přemysl & Hanzálek, Zdeněk, 2018. "Accelerating the Branch-and-Price Algorithm Using Machine Learning," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1055-1069.
    7. Sophie Veldhoven & Gerhard Post & Egbert Veen & Tim Curtois, 2016. "An assessment of a days off decomposition approach to personnel shift scheduling," Annals of Operations Research, Springer, vol. 239(1), pages 207-223, April.
    8. Anna Brown, 2016. "Item Response Models for Forced-Choice Questionnaires: A Common Framework," Psychometrika, Springer;The Psychometric Society, vol. 81(1), pages 135-160, March.
    9. Jaron T Colas, 2017. "Value-based decision making via sequential sampling with hierarchical competition and attentional modulation," PLOS ONE, Public Library of Science, vol. 12(10), pages 1-40, October.
    10. Michael C. Hout & Corbin A. Cunningham & Arryn Robbins & Justin MacDonald, 2018. "Simulating the Fidelity of Data for Large Stimulus Set Sizes and Variable Dimension Estimation in Multidimensional Scaling," SAGE Open, , vol. 8(2), pages 21582440187, April.
    11. Lee Cooper & Masao Nakanishi, 1983. "Two logit models for external analysis of preferences," Psychometrika, Springer;The Psychometric Society, vol. 48(4), pages 607-620, December.
    12. Debora Sarno & Maria Elena Nenni, 2016. "Daily nurse requirements planning based on simulation of patient flows," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 526-549, September.
    13. Despoina Alempaki & Emina Canic & Timothy L. Mullett & William J. Skylark & Chris Starmer & Neil Stewart & Fabio Tufano, 2019. "Reexamining How Utility and Weighting Functions Get Their Shapes: A Quasi-Adversarial Collaboration Providing a New Interpretation," Management Science, INFORMS, vol. 65(10), pages 4841-4862, October.
    14. Annear, Luis Mauricio & Akhavan-Tabatabaei, Raha & Schmid, Verena, 2023. "Dynamic assignment of a multi-skilled workforce in job shops: An approximate dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1109-1125.
    15. Jaron T Colas & Wolfgang M Pauli & Tobias Larsen & J Michael Tyszka & John P O’Doherty, 2017. "Distinct prediction errors in mesostriatal circuits of the human brain mediate learning about the values of both states and actions: evidence from high-resolution fMRI," PLOS Computational Biology, Public Library of Science, vol. 13(10), pages 1-32, October.
    16. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.
    17. David D. Cho & Kurt M. Bretthauer & Jan Schoenfelder, 2023. "Patient-to-nurse ratios: Balancing quality, nurse turnover, and cost," Health Care Management Science, Springer, vol. 26(4), pages 807-826, December.
    18. Giovanni Felici & Sokol Ndreca & Aldo Procacci & Benedetto Scoppola, 2016. "A-priori upper bounds for the set covering problem," Annals of Operations Research, Springer, vol. 238(1), pages 229-241, March.
    19. Pieter Smet & Annelies Lejon & Greet Vanden Berghe, 2021. "Demand smoothing in shift design," Flexible Services and Manufacturing Journal, Springer, vol. 33(2), pages 457-484, June.
    20. Burke, Edmund K. & Curtois, Tim, 2014. "New approaches to nurse rostering benchmark instances," European Journal of Operational Research, Elsevier, vol. 237(1), pages 71-81.

    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:gam:jmathe:v:12:y:2024:i:19:p:3025-:d:1487749. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.