IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/2299018.html
   My bibliography  Save this article

Multiobjective Project Scheduling with Multiple Compression Capabilities of the Multistate Activities with Project Reliability Approach using the Metaheuristic Algorithm

Author

Listed:
  • Seyed Ahmad Shayannia
  • Vijay Kumar

Abstract

We examine the time-cost-reliability-project balance of the project by considering the limitations of renewable and nonrenewable resources and performing multistate group activities in the same conditions and with the possibility of multiple compression activities. This study aimed to select the best mode for conducting actions in each subset and find the best execution method by determining the number of compression time units of actions to maximize project reliability and minimize project completion risk, time, and cost. Drilling projects will also be implemented for evaluation in the Azar oil field. The exact Epsilon Limitation method was used to solve this problem in low dimensions. The combined genetic metaheuristic algorithm and particle swarming were used to solve high dimensions problems. The low-dimensional Epsilon solution method could clearly balance the objective functions. Also, the Taguchi experimental design method was used to adjust the parameters of the problem algorithm. The correct value of the algorithm parameters is also specified. Based on the results, the hybrid metaheuristic algorithm has less solution time than the exact method. In high dimensions, as it was observed, GAMS software could not solve the problem. Still, the hybrid metaheuristic algorithm solved the problem well in high dimensions.

Suggested Citation

  • Seyed Ahmad Shayannia & Vijay Kumar, 2022. "Multiobjective Project Scheduling with Multiple Compression Capabilities of the Multistate Activities with Project Reliability Approach using the Metaheuristic Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-12, March.
  • Handle: RePEc:hin:jnlmpe:2299018
    DOI: 10.1155/2022/2299018
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/2299018.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/2299018.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/2299018?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
    ---><---

    More about this item

    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:hin:jnlmpe:2299018. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.