运筹学学报
搜索
运筹学学报
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
Tight Price of Anarchy for selfish task scheduling on two selfish machines