IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v26y2024i2p681-700.html

Optimal Intraproject Learning

Author

Listed:
  • Huan Cao

    (Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742)

  • Nicholas G. Hall

    (Fisher College of Business, The Ohio State University, Columbus, Ohio 43210)

  • Guohua Wan

    (Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200030, China)

  • Wenhui Zhao

    (Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200030, China)

Abstract

Problem definition : Intraproject learning in project scheduling involves the use of learning among the similar tasks in a project to improve the overall performance of the project schedule. Under intraproject learning, knowledge gained from completing some tasks in a project is used to execute similar later tasks in the same project more efficiently. We provide the first model and solution algorithms to address this intraproject learning problem. Academic/practical relevance : Intraproject learning is possible when, for example, the difficulty of the tasks becomes better understood, or the efficiency of the resources used becomes better known. Hence, it is necessary to explore the potential of intraproject learning to further improve the performance of project scheduling. Because learning consumes time, firms may underinvest in intraproject learning if they do not recognize its value. Although the project scheduling literature discusses the potential value of using obtained information from learning within the same project, we formally model and optimize the use of intraproject learning in project scheduling. Methodology/results : We model the tradeoff between investing time in learning from completed tasks and achieving reduced durations for subsequent tasks to minimize the total project cost. We show that this problem is intractable. We develop a heuristic that finds near optimal solutions and a strong relaxation that allows some learning from partially completed tasks. Our computational study identifies project characteristics where intraproject learning is most worthwhile. In doing so, it motivates project managers to understand and apply intraproject learning to improve the performance of their projects. A real case is provided by a problem of the Consumer Business Group of Huawei Corporation, for which our model and algorithm provide a greater than 20% improvement in project duration. Managerial implications : We find consistent evidence that projects in general can benefit substantially from intraproject learning, and larger projects benefit more. Our computational studies provide the following insights. First, the benefit from learning varies with the features of the project network, and projects with more complex networks possess greater potential benefit from intraproject learning and deserve more attention to learning opportunities; second, noncritical tasks at an earlier project stage should be learned more extensively; and third, tasks that are more similar (or have more similar processes) to later tasks also deserve more investment in learning. Learning should also be invested more in tasks that have more successors, where knowledge gained can be used repetitively.

Suggested Citation

  • Huan Cao & Nicholas G. Hall & Guohua Wan & Wenhui Zhao, 2024. "Optimal Intraproject Learning," Manufacturing & Service Operations Management, INFORMS, vol. 26(2), pages 681-700, March.
  • Handle: RePEc:inm:ormsom:v:26:y:2024:i:2:p:681-700
    DOI: 10.1287/msom.2022.0159
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2022.0159
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2022.0159?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
    ---><---

    References listed on IDEAS

    as
    1. James G. March, 1991. "Exploration and Exploitation in Organizational Learning," Organization Science, INFORMS, vol. 2(1), pages 71-87, February.
    2. Prencipe, Andrea & Tell, Fredrik, 2001. "Inter-project learning: processes and outcomes of knowledge codification in project-based firms," Research Policy, Elsevier, vol. 30(9), pages 1373-1394, December.
    3. Michael A. Lapré & Amit Shankar Mukherjee & Luk N. Van Wassenhove, 2000. "Behind the Learning Curve: Linking Learning Activities to Waste Reduction," Management Science, INFORMS, vol. 46(5), pages 597-611, May.
    4. Biskup, Dirk, 2008. "A state-of-the-art review on scheduling with learning effects," European Journal of Operational Research, Elsevier, vol. 188(2), pages 315-329, July.
    5. Paul S. Adler & Kim B. Clark, 1991. "Behind the Learning Curve: A Sketch of the Learning Process," Management Science, INFORMS, vol. 37(3), pages 267-281, March.
    6. Christofides, Nicos & Alvarez-Valdes, R. & Tamarit, J. M., 1987. "Project scheduling with resource constraints: A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 29(3), pages 262-273, June.
    7. 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.
    8. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    9. 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.
    10. Anthony A. Mastor, 1970. "An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques," Management Science, INFORMS, vol. 16(11), pages 728-746, July.
    11. Xuejun Hu & Nanfang Cui & Erik Demeulemeester, 2015. "Effective expediting to improve project due date and cost performance through buffer management," International Journal of Production Research, Taylor & Francis Journals, vol. 53(5), pages 1460-1471, March.
    12. Brucker, Peter & Knust, Sigrid & Schoo, Arno & Thiele, Olaf, 1998. "A branch and bound algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 272-288, June.
    13. Ferdinand K. Levy, 1965. "Adaptation in the Production Process," Management Science, INFORMS, vol. 11(6), pages 136-154, April.
    14. Maurizio Zollo & Jeffrey J. Reuer, 2010. "Experience Spillovers Across Corporate Development Activities," Organization Science, INFORMS, vol. 21(6), pages 1195-1212, December.
    15. Valadares Tavares, L. & Antunes Ferreira, J. & Silva Coelho, J., 1999. "The risk of delay of a project in terms of the morphology of its network," European Journal of Operational Research, Elsevier, vol. 119(2), pages 510-537, December.
    16. 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.
    17. Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
    18. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alessandro Hill & Thomas W. M. Vossen, 2025. "Efficient Project Scheduling with Autonomous Learning Opportunities," INFORMS Journal on Computing, INFORMS, vol. 37(3), pages 761-783, May.

    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. Artigues, Christian & Hartmann, Sönke & Vanhoucke, Mario, 2026. "Fifty years of research on resource-constrained project scheduling explored from different perspectives," European Journal of Operational Research, Elsevier, vol. 328(2), pages 367-389.
    2. Guo, Weikang & Vanhoucke, Mario & Coelho, José, 2023. "A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 579-595.
    3. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
    4. Alexander Tesch, 2020. "A polyhedral study of event-based models for the resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 23(2), pages 233-251, April.
    5. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
    6. Vanhoucke, Mario & Coelho, José, 2024. "A matheuristic for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 319(3), pages 711-725.
    7. Valls, Vicente & Ballestin, Francisco & Quintanilla, Sacramento, 2005. "Justification and RCPSP: A technique that pays," European Journal of Operational Research, Elsevier, vol. 165(2), pages 375-386, September.
    8. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    9. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    10. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    11. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    12. Bouleimen, K. & Lecocq, H., 2003. "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," European Journal of Operational Research, Elsevier, vol. 149(2), pages 268-281, September.
    13. Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.
    14. 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.
    15. 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.
    16. Hartmann, Sönke, 2011. "Project scheduling with resource capacities and requests varying with time," Working Paper Series 01/2011, Hamburg School of Business Administration (HSBA).
    17. Song, Jie & Song, Jinbo & Vanhoucke, Mario, 2025. "Automatic selection of the best performing control point approach for project control with resource constraints," European Journal of Operational Research, Elsevier, vol. 322(1), pages 15-38.
    18. Michael A. Lapré & Nikos Tsikriktsis, 2006. "Organizational Learning Curves for Customer Dissatisfaction: Heterogeneity Across Airlines," Management Science, INFORMS, vol. 52(3), pages 352-366, March.
    19. Moumene, Khaled & Ferland, Jacques A., 2009. "Activity list representation for a generalization of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 46-54, November.
    20. Amadeu A. Coco & Christophe Duhamel & Andréa Cynthia Santos, 2020. "Modeling and solving the multi-period disruptions scheduling problem on urban networks," Annals of Operations Research, Springer, vol. 285(1), pages 427-443, February.

    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:inm:ormsom:v:26:y:2024:i:2:p:681-700. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.