Nash equilibria for the multi-agent project scheduling problem with controllable processing times
From MaRDI portal
Publication:2018940
DOI10.1007/s10951-014-0393-xzbMath1310.90051OpenAlexW2010950708MaRDI QIDQ2018940
Cyril Briand, Jean-Charles Billaut, Alessandro Agnetis, Přemysl Šucha
Publication date: 26 March 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0393-x
Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General equilibrium theory (91B50)
Related Items (5)
Finding an optimal Nash equilibrium to the multi-agent project scheduling problem ⋮ How to apply penalties to avoid delays in projects ⋮ Nash equilibrium solutions in multi-agent project scheduling with milestones ⋮ Preface: Project management and scheduling ⋮ Price of anarchy and price of stability in multi-agent project scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling
- A game theoretical approach to sharing penalties and rewards in projects
- Project scheduling. A research handbook.
- Two approaches to the problem of sharing delay costs in joint projects
- Sequential and parallel algorithms for minimum flows.
- A market-based multi-agent system model for decentralized multi-project scheduling
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
- Distributed project scheduling with information sharing in supply chains: part I—an agent-based negotiation model
- Distributed project scheduling with information sharing in supply chains: part II—theoretical analysis and computational study
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
This page was built for publication: Nash equilibria for the multi-agent project scheduling problem with controllable processing times