搜索结果: 1-2 共查到“数学 makespan”相关记录2条 . 查询时间(0.046 秒)
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...
Trade-off between time complexity and makespan for flexible flow-shop group scheduling problems with two machine centers
group scheduling flexible flow shop Johnson algorithm
2010/9/15
The flexible flow-shop group scheduling problem is investigated in this paper to minimize the makespan. Two algorithms have been proposed to solve the problem with two machine centers, which have the ...