Solving a cooperative project scheduling with controllable processing times, self-interested agents and equal profit sharing

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00209146" target="_blank" >RIV/68407700:21230/13:00209146 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Solving a cooperative project scheduling with controllable processing times, self-interested agents and equal profit sharing
Original language description
This paper considers a cooperative project that involves a set of self-interested agents, each in charge of a part of the project. An agent can reduce the duration of the activities he is responsible for, by gathering extra-resources, at a given cost. Ifthe overall project ends earlier than expected, the client offers a reward to be shared equally among agents. The nancial outcome for each agent therefore depends on all agents decisions and on the satisfaction of the customer, which is function of theproject makespan. Under these assumptions, we address the problem of nding a Nash equi-librium, ensuring the stability of the schedule, that minimizes the project makespan. We explain how this problem, which is NP-hard, can be eciently modeled and solvedwith mixed integer linear programming.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 6th Multidisciplinary International Conference on Scheduling: Theory and Applications
ISBN
—
ISSN
2305-249X
e-ISSN
—
Number of pages
8
Pages from-to
125-132
Publisher name
University of Nottingham
Place of publication
Nottingham
Event location
Gent
Event date
Aug 27, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)