Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost
From MaRDI portal
Publication:5024478
DOI10.1142/S0217595921400078zbMath1481.90193OpenAlexW3128130192MaRDI QIDQ5024478
Long Zhang, Jiguo Yu, Yu-Zhong Zhang
Publication date: 1 February 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921400078
Pareto-optimalityscheduling gamesapproximate Nash equilibriumparallel-batching machinesapproximate gap
Related Items (1)
Cites Work
- Unnamed Item
- Batch sequencing and cooperation
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Coordination mechanisms for parallel machine scheduling
- Approximate Nash equilibria in anonymous games
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Scheduling games on uniform machines with activation cost
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines
- Efficiency analysis of load balancing games with and without activation costs
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling
- Conflicting Congestion Effects in Resource Allocation Games
- A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines
- The Complexity of Computing a Nash Equilibrium
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
This page was built for publication: Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost
