搜索结果: 1-2 共查到“运筹学 survey”相关记录2条 . 查询时间(0.092 秒)
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...
Tchebycheff systems and extremal problems for generalized moments: a brief survey
Tchebycheff systems extremal problems brief survey Optimization and Control
2011/9/14
Abstract: A brief presentation of basics of the theory of Tchebycheff and Markov systems of functions and its applications to extremal problems for integrals of such functions is given. The results, a...