Nash equilibria for the multi-agent project scheduling problem with controllable processing times
DOI10.1007/S10951-014-0393-XzbMATH Open1310.90051OpenAlexW2010950708MaRDI QIDQ2018940FDOQ2018940
Cyril Briand, J.-C. Billaut, Alessandro Agnetis, Přemysl Šůcha
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
Recommendations
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
- Nash equilibrium solutions in multi-agent project scheduling with milestones
- Nash equilibria in competitive project scheduling
- Price of anarchy and price of stability in multi-agent project scheduling
- scientific article; zbMATH DE number 1054687
- Reachability games for optimal multi-agent scheduling of tasks with variable durations
- The bilevel optimisation of a multi-agent project scheduling and staffing problem
- A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
- Optimal scheduling and control for constrained multi‐agent networked control systems
- Computing the Nash solution for scheduling bargaining problems
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic network models in operations research (90B15) General equilibrium theory (91B50) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- Two approaches to the problem of sharing delay costs in joint projects
- A game theoretical approach to sharing penalties and rewards in projects
- Title not available (Why is that?)
- Competitive Two-Agent Scheduling and Its Applications
- Scheduling Problems with Two Competing Agents
- Project scheduling. A research handbook.
- A market-based multi-agent system model for decentralized multi-project scheduling
- A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling
- 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
- Sequential and parallel algorithms for minimum flows.
Cited In (7)
- How to apply penalties to avoid delays in projects
- Nash equilibria in competitive project scheduling
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
- Nash equilibrium solutions in multi-agent project scheduling with milestones
- Price of anarchy and price of stability in multi-agent project scheduling
- Preface: Project management and scheduling
- Title not available (Why is that?)
This page was built for publication: Nash equilibria for the multi-agent project scheduling problem with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018940)
