SciELO - Scientific Electronic Library Online

vol.19 issue1A Scatter Search Algorithm for Solving a Bilevel Optimization Model for Determining Highway TollsSaving Time for Object Finding with a Mobile Manipulator Robot in 3D Environment author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Computación y Sistemas

Print version ISSN 1405-5546


DE ITA LUNA, Guillermo; ZACARIAS-FLORES, Fernando  and  ALTAMIRANO-ROBLES, L. Carlos. Finding Pure Nash Equilibrium for the Resource-Constrained Project Scheduling Problem. Comp. y Sist. [online]. 2015, vol.19, n.1, pp.17-27. ISSN 1405-5546.

The paper focuses on solving the Resource-Constrained Project Scheduling (RCPS) problem with a method based on intelligent agents. Parallelism for performing the tasks is allowed. Common and limited resources are available to all agents. The agents are non-cooperative and compete with each other for the use of common resources, thereby forming instances of RCPS problem. We analyze the global joint interaction of scheduling via a congestion network and seek to arrive at stable assignments of scheduling. For this class of network, stable assignments of scheduling correspond to a pure Nash equilibrium, and we show that in this case there is a guarantee of obtaining a pure Nash equilibrium in polynomial time complexity. The pure Nash equilibrium point for this congestion network will be a local optimum in the neighborhood structure of the projects, where no project can improve its completion time without negatively affecting the completion time of the total system. In our case, each state of the neighborhood represents an instance of the RCPS problem, and for solving such problem, we apply a novel greedy heuristic. It has a polynomial time complexity and works similar to the well-knowing heuristic NEH.

Keywords : Intelligent agents; congestion network; pure Nash equilibrium; RCPS problem; multi-scheduling; greedy heuristic NEH.

        · text in English     · English ( pdf )


Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License