Tight Price of Anarchy for selfish task scheduling on two selfish machines_参考网

Tight Price of Anarchy for selfish task scheduling on two selfish machines

2023-01-04chengxiayan,heying,zhaocongcong等

运筹学学报 2022年3期

运筹学学报

运筹学学报的其它文章

Maximum matching based approximation algorithms for precedence constrained scheduling problems
Sharing bicycle relocating with minimum carbon emission
On the worst-case ratio of algorithm SPT for two uniform machines scheduling with minisum criteria