A selfish allocation heuristic in scheduling: Equilibrium and inefficiency bound analysis

•A framework of equilibrium heuristic for multiple decision maker problems.•Implementation of the framework in a setting of sequencing situations.•Selfish agents, multiple identical machines, sum of completion times.•Tight upper bound for the equilibrium heuristic. Relation with the price of anarchy.•Simulations to study the performance of the equilibrium heuristic.