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

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.

[1]  Neil Immerman,et al.  The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.

[2]  Sven Koenig,et al.  Optimal Target Assignment and Path Finding for Teams of Agents , 2016, AAMAS.

[3]  Paolo Renna,et al.  Capacity sharing in a network of enterprises using the Gale–Shapley model , 2013 .

[4]  Minjie Zhang,et al.  Coordination for dynamic weighted task allocation in disaster environments with time, space and communication constraints , 2016, J. Parallel Distributed Comput..

[5]  Hoong Chuin Lau,et al.  Stochastic dominance in stochastic DCOPs for risk-sensitive applications , 2012, AAMAS.

[6]  Norio Tomii,et al.  A MIP-based timetable rescheduling formulation and algorithm minimizing further inconvenience to passengers , 2013, J. Rail Transp. Plan. Manag..

[7]  Ernesto Nunes,et al.  Iterated Multi-Robot Auctions for Precedence-Constrained Task Scheduling , 2016, AAMAS.

[8]  Lin Zhang,et al.  Agent-based simulation platform for cloud manufacturing , 2017, Int. J. Model. Simul. Sci. Comput..

[9]  Duncan A. Robertson An Introduction to Multi-Agent Systems by Michael Wooldridge , 2004, J. Artif. Soc. Soc. Simul..

[10]  Keith S. Decker,et al.  A complete distributed constraint optimization method for non-traditional pseudotree arrangements , 2007, AAMAS '07.

[11]  Fabien Leurent,et al.  Transport capacity constraints on the mass transit system: a systemic analysis , 2011 .

[12]  Shlomo Zilberstein,et al.  Policy Iteration for Decentralized Control of Markov Decision Processes , 2009, J. Artif. Intell. Res..

[13]  Jie Zhang,et al.  Decentralized Multi-Project Scheduling via Multi-Unit Combinatorial Auction , 2016, AAMAS.

[14]  Fei Tao,et al.  Resource service sharing in cloud manufacturing based on the Gale–Shapley algorithm: advantages and challenge , 2017, Int. J. Comput. Integr. Manuf..

[15]  Xiang Li,et al.  Train Rescheduling With Stochastic Recovery Time: A New Track-Backup Approach , 2014, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[16]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[17]  Paolo Renna,et al.  Supporting capacity sharing in the cloud manufacturing environment based on game theory and fuzzy logic , 2016, Enterp. Inf. Syst..

[18]  Anthony A. Maciejewski,et al.  Stochastic-based robust dynamic resource allocation for independent tasks in a heterogeneous computing system , 2016, J. Parallel Distributed Comput..

[19]  Johanna Törnquist Krasemann Greedy algorithm for railway traffic re-scheduling during disturbances: A Swedish case , 2010 .

[20]  Luca Maria Gambardella,et al.  On Decentralized Coordination for Spatial Task Allocation and Scheduling in Heterogeneous Teams , 2016, AAMAS.

[21]  Anthony A. Maciejewski,et al.  Scalable linear programming based resource allocation for makespan minimization in heterogeneous computing systems , 2015, J. Parallel Distributed Comput..

[22]  Xin Yao,et al.  Benchmarking and solving dynamic constrained problems , 2009, 2009 IEEE Congress on Evolutionary Computation.

[23]  Bart De Schutter,et al.  Reducing the time needed to solve the global rescheduling problem for railway networks , 2013, 16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013).