Nash equilibrium solutions in multi-agent project scheduling with milestones

DOI10.1016/j.ejor.2021.01.023zbMath1487.90327OpenAlexW3127180951MaRDI QIDQ2031069

Marko Šidlovský, Cyril Briand, Alessandro Agnetis, Přemysl Šucha

Publication date: 8 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.01.023

zbMATH Keywords

project schedulingNash equilibriaflow networksmilestoneslazy-constraint generation

Mathematics Subject Classification ID

Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Single-machine scheduling of multiple projects with controllable processing times

Uses Software

• RanGen

Cites Work

• Unnamed Item
• A game theoretical approach to sharing penalties and rewards in projects
• Nash equilibria in competitive project scheduling
• Project scheduling. A research handbook.
• Two approaches to the problem of sharing delay costs in joint projects
• Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
• How to apply penalties to avoid delays in projects
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Price of anarchy and price of stability in multi-agent project scheduling
• Rangen: A random network generator for activity-on-the-node networks
• A market-based multi-agent system model for decentralized multi-project scheduling
• Phase transitions in project scheduling
• Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
• On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem

This page was built for publication: Nash equilibrium solutions in multi-agent project scheduling with milestones