Nash equilibria for the multi-agent project scheduling problem with controllable processing times

DOI10.1007/S10951-014-0393-XMaRDI QIDQ2018940zbMATH OpenOpenAlexFDO

Authors Alessandro Agnetis, Cyril Briand, J.-C. Billaut, 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

zbMATH Keywords

Nash equilibriaflow networksmulti-agent project scheduling

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling
• A game theoretical approach to sharing penalties and rewards in projects
• A market-based multi-agent system model for decentralized multi-project scheduling
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Competitive two-agent scheduling and its applications
• Distributed project scheduling with information sharing in supply chains: part II—theoretical analysis and computational study
• Distributed project scheduling with information sharing in supply chains: part I—an agent-based negotiation model
• Network flows. Theory, algorithms, and applications.
• Project scheduling. A research handbook.
• Scheduling Problems with Two Competing Agents
• Sequential and parallel algorithms for minimum flows.
• Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
• Two approaches to the problem of sharing delay costs in joint projects

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
• scientific article; zbMATH DE number 1054687 (Why is no real title available?)

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)