搜索结果: 1-2 共查到“运筹学 scheduling”相关记录2条 . 查询时间(0.05 秒)
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...
Single machine scheduling with processing time functions of starting time or position
operations research scheduling single machine processing time function time dependent
2011/11/14
In this paper, two single machine scheduling models with general processing time functions are considered. Job's processing time is assumed to be basic processing time adds a function of starting time...