搜索结果: 1-1 共查到“运筹学 minimize”相关记录1条 . 查询时间(0 秒)
Online over time scheduling on unbounded p-batch machines to minimize the makespan: A survey
operation sresearch online scheduling parallel-batch machines makespan competitive ratio
2011/11/14
Online scheduling is a rapidly developed branch in scheduling theory. In the research of online scheduling, makespan minimization on unbounded parallel-batch machines is a fruitful area. In this paper...