Algorithm for the multiagent project scheduling problem
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
BenchmarkInstances
MILP
LICENSE
readme.txt

readme.txt

Multi-Agent Project Scheduling Problem - An exact approach based on MILP
------------------------------------------------------------------------

Premysl Sucha, Cyril Briand and Ngueveu Sandra Ulrich, (C) 2011

CNRS, LAAS, 7 avenue du colonel Roche, F-31077 Toulouse Cedex 4, France
  and
Czech Technical University in Prague, Karlovo namesti 13, 121 35, Prague , Czech Republic

------------------------------------------------------------------------

This model solves Multi-Agent Project Scheduling Problem. The objective is
to find a Nash equilibrya which minimizes Cmax.

The details about this method can be found in:

Briand C. - Ngueveu, S.U. - Šùcha, P. Finding an optimal Nash equilibrium to
the multi-agent project scheduling problem In: Journal of Scheduling. 2017,
DOI: 10.1007/s10951-017-0516-2

The MILP model is implemented in IBM ILOG CPLEX Optimization Studio, version 12.6.3.0.

If you find this code useful, please cite our paper. Thank you.