IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v6y2019ics2214716019300958.html
   My bibliography  Save this article

Hybrid multimode resource-constrained maintenance project scheduling problem

Author

Listed:
  • Kosztyán, Zsolt T.
  • Pribojszki-Németh, Anikó
  • Szalkai, István

Abstract

Organizing maintenance tasks is a specific and important field of project and production management. Well-planned, properly scheduled, and effectively communicated maintenance tasks result in the accomplishment of more work that is performed more efficiently at a lower cost. In maintenance and production management, agile and lean approaches are becoming more frequently used, where preventive/predictive maintenance (PPM) requires flexible project plans to decide which system components (or equipment) should be maintained to achieve the target system reliability. Maintenance projects have been treated as fixed sequences of corrective/preventive tasks, while the agile/lean approach allows for and usually requires prioritizing tasks and reorganizing the project structure. The fixed structure of maintenance projects and traditional maintenance project scheduling algorithms are not considered representative of these agile properties. The paper models the preventive resource-constrained maintenance project scheduling problem and aims at optimizing its maintainability. A matrix-based algorithm is proposed to apply to both system and project structures that include both traditional and agile/lean project management approaches.

Suggested Citation

  • Kosztyán, Zsolt T. & Pribojszki-Németh, Anikó & Szalkai, István, 2019. "Hybrid multimode resource-constrained maintenance project scheduling problem," Operations Research Perspectives, Elsevier, vol. 6(C).
  • Handle: RePEc:eee:oprepe:v:6:y:2019:i:c:s2214716019300958
    DOI: 10.1016/j.orp.2019.100129
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716019300958
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.orp.2019.100129?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Samrout, M. & Châtelet, E. & Kouta, R. & Chebbo, N., 2009. "Optimization of maintenance policy using the proportional hazard model," Reliability Engineering and System Safety, Elsevier, vol. 94(1), pages 44-52.
    2. Kosztyán, Zsolt T. & Szalkai, István, 2018. "Hybrid time-quality-cost trade-off problems," Operations Research Perspectives, Elsevier, vol. 5(C), pages 306-318.
    3. Prabuddha De & E. James Dunne & Jay B. Ghosh & Charles E. Wells, 1997. "Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks," Operations Research, INFORMS, vol. 45(2), pages 302-306, April.
    4. Betty J. Flehinger, 1960. "System Reliability as a Function of System Age; Effects of Intermittent Component Usage and Periodic Maintenance," Operations Research, INFORMS, vol. 8(1), pages 30-44, February.
    5. De, Prabuddha & James Dunne, E. & Ghosh, Jay B. & Wells, Charles E., 1995. "The discrete time-cost tradeoff problem revisited," European Journal of Operational Research, Elsevier, vol. 81(2), pages 225-238, March.
    6. Yang, Li & Ye, Zhi-sheng & Lee, Chi-Guhn & Yang, Su-fen & Peng, Rui, 2019. "A two-phase preventive maintenance policy considering imperfect repair and postponed replacement," European Journal of Operational Research, Elsevier, vol. 274(3), pages 966-977.
    7. D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
    8. Tiwari, Vikram & Patterson, James H. & Mabert, Vincent A., 2009. "Scheduling projects with heterogeneous resources to meet time and quality objectives," European Journal of Operational Research, Elsevier, vol. 193(3), pages 780-790, March.
    9. Said, Samer S. & Haouari, Mohamed, 2015. "A hybrid simulation-optimization approach for the robust Discrete Time/Cost Trade-off Problem," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 628-636.
    10. Babu, A. J. G. & Suresh, Nalina, 1996. "Project management with time, cost, and quality considerations," European Journal of Operational Research, Elsevier, vol. 88(2), pages 320-327, January.
    11. Robert Pellerin & Nathalie Perrier, 2019. "A review of methods, techniques and tools for project planning and control," International Journal of Production Research, Taylor & Francis Journals, vol. 57(7), pages 2160-2178, April.
    12. Kolisch, Rainer & Sprecher, Arno, 1997. "PSPLIB - A project scheduling problem library : OR Software - ORSEP Operations Research Software Exchange Program," European Journal of Operational Research, Elsevier, vol. 96(1), pages 205-216, January.
    13. I Ben-David & T Raz, 2001. "An integrated approach for risk response development in project planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(1), pages 14-25, January.
    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. Zsolt T. Kosztyán & Eszter Bogdány & István Szalkai & Marcell T. Kurbucz, 2022. "Impacts of synergies on software project scheduling," Annals of Operations Research, Springer, vol. 312(2), pages 883-908, 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. Kosztyán, Zsolt T. & Szalkai, István, 2018. "Hybrid time-quality-cost trade-off problems," Operations Research Perspectives, Elsevier, vol. 5(C), pages 306-318.
    2. Zsolt T. Kosztyán & István Szalkai, 2020. "Multimode resource-constrained project scheduling in flexible projects," Journal of Global Optimization, Springer, vol. 76(1), pages 211-241, January.
    3. Nicole Megow & Rolf H. Möhring & Jens Schulz, 2011. "Decision Support and Optimization in Shutdown and Turnaround Scheduling," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 189-204, May.
    4. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    5. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
    6. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    7. Akkan, Can & Drexl, Andreas & Kimms, Alf, 2000. "Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 527, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Kosztyán, Zsolt T. & Jakab, Róbert & Novák, Gergely & Hegedűs, Csaba, 2020. "Survive IT! Survival analysis of IT project planning approaches," Operations Research Perspectives, Elsevier, vol. 7(C).
    9. Hongbo Li & Zhe Xu & Wenchao Wei, 2018. "Bi-Objective Scheduling Optimization for Discrete Time/Cost Trade-Off in Projects," Sustainability, MDPI, vol. 10(8), pages 1-15, August.
    10. A B Hafızoğlu & M Azizoğlu, 2010. "Linear programming based approaches for the discrete time/cost trade-off problem in project networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 676-685, April.
    11. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    12. Eleni Hadjiconstantinou & Evelina Klerides, 2010. "A new path-based cutting plane approach for the discrete time-cost tradeoff problem," Computational Management Science, Springer, vol. 7(3), pages 313-336, July.
    13. Mick Van Den Eeckhout & Broos Maenhout & Mario Vanhoucke, 2020. "Mode generation rules to define activity flexibility for the integrated project staffing problem with discrete time/resource trade-offs," Annals of Operations Research, Springer, vol. 292(1), pages 133-160, September.
    14. Zhang, Jingwen & Elmaghraby, Salah E., 2014. "The relevance of the “alphorn of uncertainty” to the financial management of projects under uncertainty," European Journal of Operational Research, Elsevier, vol. 238(1), pages 65-76.
    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. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
    17. Wei He & Wenjing Li & Wei Wang, 2021. "Developing a Resource Allocation Approach for Resource-Constrained Construction Operation under Multi-Objective Operation," Sustainability, MDPI, vol. 13(13), pages 1-22, June.
    18. Perrone, G. & Roma, P. & Lo Nigro, G., 2010. "Designing multi-attribute auctions for engineering services procurement in new product development in the automotive context," International Journal of Production Economics, Elsevier, vol. 124(1), pages 20-31, March.
    19. Dharma Kwon, H. & Lippman, Steven A. & Tang, Christopher S., 2011. "Sourcing decisions of project tasks with exponential completion times: Impact on operating profits," International Journal of Production Economics, Elsevier, vol. 134(1), pages 138-150, November.
    20. Collin Huse & Michael J. Brusco, 2021. "A Tale of Two Linear Programming Formulations for Crashing Project Networks," INFORMS Transactions on Education, INFORMS, vol. 22(1), pages 82-95, January.

    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:eee:oprepe:v:6:y:2019:i:c:s2214716019300958. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/operations-research-perspectives .

    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.