IDEAS home Printed from https://ideas.repec.org/a/taf/nmcmxx/v24y2018i5p505-525.html
   My bibliography  Save this article

Dynamic process scheduling and resource allocation in distributed environment: an agent-based modelling and simulation

Author

Listed:
  • Poulami Dalapati
  • Piyush Agarwal
  • Animesh Dutta
  • Swapan Bhattacharya

Abstract

This paper addresses the issues concerning resource allocation and process scheduling in a dynamic environment, where resources are distributed and availability of them is uncertain. In this context, we introduce a new multi-agent-based resource allocation and process scheduling approach, where agents communicate and cooperate among themselves to produce an optimal schedule. A distributed constraint optimization problem-based model in accordance with Markov Decision Process is proposed in this regard. We overcome the hardship of existing centralized approach and our technique optimizes not only the process completion delay but also the number of resources being idle, which is much more beneficial. Apart from the theoretical approach, we take a case study in its practical application domain to validate our claim. Analysis and experimental results show that this proposed method outperforms the state-of-the-art methods and bridges the gap between theory and its applications.

Suggested Citation

  • Poulami Dalapati & Piyush Agarwal & Animesh Dutta & Swapan Bhattacharya, 2018. "Dynamic process scheduling and resource allocation in distributed environment: an agent-based modelling and simulation," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 24(5), pages 505-525, September.
  • Handle: RePEc:taf:nmcmxx:v:24:y:2018:i:5:p:505-525
    DOI: 10.1080/13873954.2018.1512504
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13873954.2018.1512504
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/13873954.2018.1512504?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.

    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:taf:nmcmxx:v:24:y:2018:i:5:p:505-525. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/NMCM20 .

    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.