Mixed coordination mechanisms for scheduling games on hierarchical machines

Related Items (3)

Coordination mechanisms for scheduling games with machine modification ⋮ A survey on obstacles and difficulties of practical implementation of horizontal collaboration in logistics ⋮ The price of anarchy in closed‐loop supply chains

Cites Work

Unnamed Item
Unnamed Item
Coordination mechanisms with hybrid local policies
Fast approximation algorithms for job scheduling with processing set restrictions
Worst-case equilibria
Improved bounds for online scheduling with eligibility constraints
Coordination mechanisms
Online scheduling on parallel machines with two goS levels
Coordination mechanisms for selfish scheduling
The exact LPT-bound for maximizing the minimum completion time
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Parallel machine scheduling under a grade of service provision
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
Coordination mechanism for selfish scheduling under a grade of service provision
A research survey: review of flexible job shop scheduling techniques
The Price of Stability for Network Design with Fair Cost Allocation
Scheduling parallel machines with inclusive processing set restrictions
POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Bounds for Certain Multiprocessing Anomalies
Bounds on Multiprocessing Timing Anomalies
Makespan minimization in online scheduling with machine eligibility
A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method
Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs

This page was built for publication: Mixed coordination mechanisms for scheduling games on hierarchical machines