Algorithm for the multiagent project scheduling problem
License
CTU-IIG/MAPSP
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
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.
About
Algorithm for the multiagent project scheduling problem
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published